Given two binary strings, return their sum (also a binary string).
For example,
a = "11"
b = "1"
Return "100"
.
翻译:
给定两个二进制字符串,返回它们的和(也是一个二进制字符串)。
例如,
a = "11"
b = "1"
Return "100"
。
思路:先反转两个字符串,再计算两个字符串的长度,设标志位,循环加减每一位和标志位,注意要判断长度较小的字符串是否有值,最后还要判断是否需要进位并反转最终结果。
public String addBinary(String a, String b) {
StringBuilder result = new StringBuilder();
String rev_a = new StringBuilder(a).reverse().toString();
String rev_b = new StringBuilder(b).reverse().toString();
int aLen = a.length();
int bLen = b.length();
int maxLen = Math.max(aLen,bLen);
int minLen = Math.min(aLen,bLen);
int flag = 0;
for(int i = 0; i<maxLen; i++){
if(aLen>=bLen && i>=minLen){
int y = rev_a.charAt(i)-'0' + flag;
if(y==2){
flag = 1;
result.append("0");
}else{
flag = 0;
result.append(String.valueOf(y));
}
continue;
}
if(aLen<bLen && i>=minLen){
int y = rev_b.charAt(i)-'0' + flag;
if(y==2){
flag = 1;
result.append("0");
}else{
flag = 0;
result.append(String.valueOf(y));
}
continue;
}
int y = (rev_a.charAt(i)-'0') + (rev_b.charAt(i)-'0') + flag;
if(y==3){
flag = 1;
result.append("1");
}
if(y==2){
flag = 1;
result.append("0");
}
if(y==1 || y == 0){
flag = 0;
result.append(String.valueOf(y));
}
}
if(flag == 1) result.append("1");
return result.reverse().toString();
}
答案思路:先得到a和b的长度i和j,设一个标志位,while循环判断是否i和j大于零,即是否还有值没加完,循环内先让sum等于进位,再依次判断a和b是否还有值,若有则sum加该值,最后用对2取余做该位结果,用对2取整做进位标志。
public String addBinary(String a, String b) {
StringBuilder sb = new StringBuilder();
int i = a.length() - 1, j = b.length() -1, carry = 0;
while (i >= 0 || j >= 0) {
int sum = carry;
if (j >= 0) sum += b.charAt(j--) - '0';
if (i >= 0) sum += a.charAt(i--) - '0';
sb.append(sum % 2);
carry = sum / 2;
}
if (carry != 0) sb.append(carry);
return sb.reverse().toString();
}