forked from franklingu/leetcode-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution.java
More file actions
57 lines (55 loc) · 1.51 KB
/
Solution.java
File metadata and controls
57 lines (55 loc) · 1.51 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
/**
* 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) {
if (a == null && b == null) {
return null;
} else if (a == null) {
return b;
} else if (b == null) {
return a;
}
StringBuilder sb = new StringBuilder();
int runner = 0;
int carry = 0;
int result = 0;
while (runner < a.length() && runner < b.length()) {
result = carry + (a.charAt(a.length() - 1 - runner) - '0') + (b.charAt(b.length() - 1 - runner) - '0');
carry = result / 2;
result = result % 2;
if (result == 0) {
sb.insert(0, '0');
} else {
sb.insert(0, '1');
}
runner++;
}
String remaining;
if (runner >= a.length()) {
remaining = b;
} else {
remaining = a;
}
while (runner < remaining.length()) {
result = carry + (remaining.charAt(remaining.length() - 1 - runner) - '0');
carry = result / 2;
result = result % 2;
if (result == 0) {
sb.insert(0, '0');
} else {
sb.insert(0, '1');
}
runner++;
}
if (carry == 1) {
sb.insert(0, '1');
}
return sb.toString();
}
}