【LeetCode從零單排】No67.AddBinary
題目
Given two binary strings, return their sum (also a binary string).
For example,
a = "11"
b = "1"
Return "100"
.
程式碼
public class Solution {
public String addBinary(String a, String b) {
String lon= a.length()-b.length()>=0 ? a:b;
String sho= a.length()-b.length()<0 ? a:b;
char[] lon_char=lon.toCharArray();
char[] sho_char=sho.toCharArray();
char temp='0';
int final_length=lon.length()-1;
int index=0;
String[] str=new String[lon.length()+1];
String addBinary_str="";
for(int i=0;i<sho.length();i++){
String temp_s=String.valueOf(temp);
String sho_char_s=String.valueOf(sho_char[sho.length()-1-i]);
String lon_char_s=String.valueOf(lon_char[lon.length()-1-i]);
switch(Integer.parseInt(temp_s)+Integer.parseInt(sho_char_s)+Integer.parseInt(lon_char_s))
{ case 0:
temp='0';
str[index++]="0";
break;
case 1:
temp='0';
str[index++]="1";
break;
case 2:
temp='1';
str[index++]="0";
break;
case 3:
temp='1';
str[index++]="1";
break;
}
}
while(index<lon.length()){
String temp_s=String.valueOf(temp);
String lon_char_s=String.valueOf(lon_char[lon.length()-index-1]);
switch(Integer.parseInt(temp_s)+Integer.parseInt(lon_char_s))
{ case 0:
temp='0';
str[index++]="0";
break;
case 1:
temp='0';
str[index++]="1";
break;
case 2:
temp='1';
str[index++]="0";
break;
}
}
if(temp=='1'){
str[lon.length()]="1";
final_length=lon.length();
}
for(int k=final_length;k>=0;k--){
addBinary_str+=str[k];
}
return addBinary_str;
}
}
/********************************
* 本文來自部落格 “李博Garvin“
* 轉載請標明出處:http://blog.csdn.net/buptgshengod
******************************************/
相關文章
- 【LeetCode從零單排】No38.CountAndSayLeetCode
- 【LeetCode從零單排】No.7 Reverse IntegerLeetCode
- 【LeetCode從零單排】No20.ValidParenthesesLeetCode
- 【LeetCode從零單排】No19.RemoveNthNodeFromEndofListLeetCodeREM
- 【LeetCode從零單排】No21.MergeTwoSortedListsLeetCode
- 【LeetCode從零單排】No27.Remove ElementLeetCodeREM
- 【LeetCode從零單排】No28 Implement strStr()LeetCode
- 【LeetCode從零單排】No22.Generate ParenthesesLeetCode
- 【LeetCode從零單排】No58.Length of Last WordLeetCodeAST
- 【LeetCode從零單排】No70.ClimbingStairsLeetCodeAI
- 【LeetCode從零單排】No.9 Palindrome NumberLeetCode
- 【LeetCode從零單排】No14.LongestCommonPrefixLeetCode
- 【LeetCode從零單排】No36 Valid SudokuLeetCode
- 【LeetCode從零單排】No221.Maximal SquareLeetCode
- 【LeetCode從零單排】No15 3SumLeetCode
- 【LeetCode從零單排】No189 .Rotate ArrayLeetCode
- 【LeetCode從零單排】No88.Merge Sorted ArrayLeetCode
- Mysql從零單排-1MySql
- 【LeetCode從零單排】No96 Unique Binary Search TreesLeetCode
- 【LeetCode從零單排】No112 Path SumLeetCode
- 【LeetCode從零單排】No.169 Majority Element(hashmap用法)LeetCodeHashMap
- 【LeetCode從零單排】No83 Remove Duplicates from Sorted ListLeetCodeREM
- 【LeetCode從零單排】No26.Remove Duplicates from Sorted ArrayLeetCodeREM
- 從零單排學Redis【白銀】Redis
- 【LeetCode從零單排】No 3 Longest Substring Without Repeating CharactersLeetCode
- 【LeetCode從零單排】No129 Sum Root to Leaf NumbersLeetCode
- 【LeetCode從零單排】No.160 Intersection of Two Linked ListsLeetCode
- 從零單排學Redis【黃金】Redis
- 【LeetCode從零單排】No121 Best Time to Buy and Sell StockLeetCode
- 【LeetCode從零單排】No118 Pascal's TriangleLeetCode
- 【LeetCode從零單排】No104 Maximum Depth of Binary TreeLeetCode
- 【LeetCode從零單排】No 114 Flatten Binary Tree to Linked ListLeetCode
- 【LeetCode從零單排】No 191.Number of 1 Bits(考察位運算)LeetCode
- 從零單排學Redis【鉑金二】Redis
- 從零單排學Redis【鉑金一】Redis
- 【LeetCode從零單排】No102 Binary Tree Level Order TraversalLeetCode
- 【LeetCode從零單排】No.135Candy(雙向動態規劃)LeetCode動態規劃
- 「從零單排canal 07」 parser模組原始碼解析原始碼