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) {
int m = a.length();
int n = b.length();
if(m == 0 && n == 0)
return "";
String result = "";
int res = 0, i = 0, sum = 0;
for(; i < m && i < n; i++){
sum = (a.charAt(m-1-i)-'0')+(b.charAt(n-1-i)-'0')+res; //把两个字符串从右向左遍历,进行加和, -'0'是为了将该数字字符转换为整型数字(两个字符相减实际上是ASCII码对应的数相减)
result = sum%2 + result; //注意前后顺序,是余数往前插入
res = sum/2;
}
while(i < m){
sum = (a.charAt(m-1-i)-'0')+res;
result = sum%2 + result;
res = sum/2;
i++;
}
while(i < n){
sum = (b.charAt(n-1-i)-'0')+res;
result = sum%2 + result;
res = sum/2;
i++;
}
if(res != 0)
result =res+result;//把最高位补上
return result;
}
}