g0001_0100.s0067_add_binary.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
package g0001_0100.s0067_add_binary;
// #Easy #String #Math #Bit_Manipulation #Simulation #Programming_Skills_II_Day_5
// #2022_06_18_Time_2_ms_(88.95%)_Space_43.1_MB_(38.33%)
public class Solution {
public String addBinary(String a, String b) {
char[] aArray = a.toCharArray();
char[] bArray = b.toCharArray();
StringBuilder sb = new StringBuilder();
int i = aArray.length - 1;
int j = bArray.length - 1;
int carry = 0;
while (i >= 0 || j >= 0) {
int sum = (i >= 0 ? aArray[i] - '0' : 0) + (j >= 0 ? bArray[j] - '0' : 0) + carry;
sb.append(sum % 2);
carry = sum / 2;
if (i >= 0) {
i--;
}
if (j >= 0) {
j--;
}
}
if (carry != 0) {
sb.append(carry);
}
return sb.reverse().toString();
}
}