-
Notifications
You must be signed in to change notification settings - Fork 32
/
Copy path61_addBinary.java
50 lines (48 loc) · 1.26 KB
/
61_addBinary.java
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
public class Solution {
/**
* @param a a number
* @param b a number
* @return the result
*/
public String addBinary(String a, String b) {
// Write your code here
if(a==null&&b==null)
return null;
int lenA = a.length();
int lenB = b.length();
int cur=0;
int pre=0;
int min=Min(lenA,lenB);
StringBuilder result = new StringBuilder("");
int i=1;
while(i<=min){
cur = (a.charAt(lenA-i)-'0'+b.charAt(lenB-i)-'0'+pre)%2;
pre = (a.charAt(lenA-i)-'0'+b.charAt(lenB-i)-'0'+pre)/2;
result.insert(0,cur);
i++;
}
if(lenA-min>0){
i = lenA-min-1;
while(i>=0){
cur = (a.charAt(i)-'0'+pre)%2;
pre = (a.charAt(i)-'0'+pre)/2;
result.insert(0,cur);
i--;
}
}else if(lenB-min>0){
i = lenB-min-1;
while(i>=0){
cur = (b.charAt(i)-'0'+pre)%2;
pre = (b.charAt(i)-'0'+pre)/2;
result.insert(0,cur);
i--;
}
}
if(pre!=0)
result.insert(0,pre);
return result.toString();
}
public int Min(int num1,int num2){
return num1<num2?num1:num2;
}
}