题目描述:
给你两个二进制字符串,返回它们的和(用二进制表示)。输入为 非空 字符串且只包含数字 1 和 0。
提示:
- 每个字符串仅由字符 ‘0’ 或 ‘1’ 组成。
- 1 <= a.length, b.length <= 10^4
- 字符串如果不是 “0” ,就都不含前导零。
示例 1:
输入: a = “11”, b = “1”
输出: “100”
示例 2:
输入: a = “1010”, b = “1011”
输出: “10101”
代码如下:
class Solution {
public String addBinary(String a, String b) {
int m = a.length();
int n = b.length();
StringBuilder sb = new StringBuilder();
Stack<Character> stack1 = new Stack<>();
Stack<Character> stack2 = new Stack<>();
if (m >= n) {
for (int i = 0; i < m; i++) {
stack1.push(a.charAt(i));
}
for (int j = 0; j < m - n; j++) {
stack2.push('0');
}
for (int k = 0; k < n; k++) {
stack2.push(b.charAt(k));
}
} else {
for (int i = 0; i < n; i++) {
stack2.push(b.charAt(i));
}
for (int j = 0; j < n - m; j++) {
stack1.push('0');
}
for (int k = 0; k < m; k++) {
stack1.push(a.charAt(k));
}
}
int len = stack1.size();
int ans = 0;
int sum = 0;
for (int i = 0; i < len; i++) {
int x = stack1.pop() - '0';
int y = stack2.pop() - '0';
sum = x + y + ans;
if (sum >= 2) {
sb.append(sum - 2);
ans = 1;
} else {
sb.append(sum);
ans = 0;
}
}
if (sum >= 2) {
sb.append(1);
}
return sb.reverse().toString();
}
}
执行结果: