forked from rpj911/LeetCode_algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAddBinary.java
More file actions
65 lines (54 loc) · 1.61 KB
/
AddBinary.java
File metadata and controls
65 lines (54 loc) · 1.61 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
58
59
60
61
62
63
64
65
package Algorithms;
public class AddBinary {
public static void main(String[] args) {
AddBinary ab = new AddBinary();
System.out.println(ab.addBinary("100", "110010"));
return;
}
public String addBinary(String a, String b) {
int sLen = 0;
int lLen = 0;
int carries = 0;
String l = null;
String s = null;
if (a.length() > b.length()) {
sLen = b.length();
lLen = a.length();
l = a;
s = b;
} else {
sLen = a.length();
lLen = b.length();
l = b;
s = a;
}
StringBuilder rst = new StringBuilder();
int i = 0;
for (i = sLen - 1; i >= 0; i--) {
int sum = (int)(s.charAt(i) - '0') + (int)(l.charAt(lLen - sLen + i) - '0') + carries;
if (sum >= 2) {
carries = 1;
} else {
carries = 0;
}
rst.insert(0, String.valueOf(sum%2));
}
for (i = lLen - sLen - 1; i >= 0; i--) {
if (carries == 1) {
if (l.charAt(i) == '0') {
carries = 0;
rst.insert(0,'1');
} else {
rst.insert(0,'0');
}
} else {
rst.insert(0, l, 0, i + 1);
return rst.toString();
}
}
if (carries == 1) {
rst.insert(0,'1');
}
return rst.toString();
}
}