-
Notifications
You must be signed in to change notification settings - Fork 0
/
BinaryAddition.java
65 lines (53 loc) · 1.51 KB
/
BinaryAddition.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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
// Binary addition of two number
// https://leetcode.com/problems/add-binary/description/#
public class BinaryAddition {
public static String binaryAddtion(String a, String b) {
StringBuilder resultSum = new StringBuilder();
String result = "";
// make sure each string is of same length or prepend with 0's
if (a.length() > b.length()) {
b = equalize(a.length(), b);
} else if (a.length() < b.length()) {
a = equalize(b.length(), a);
}
char[] aArray = a.toCharArray();
char[] bArray = b.toCharArray();
int carry = 0;
// add each of the character
for (int i = a.length() - 1; i >= 0; i--) {
int add = Character.getNumericValue(aArray[i]) + Character.getNumericValue(bArray[i]) + carry;
// Based on add, assign carry and the result
if (add == 3) {
resultSum.insert(0, 1);
carry = 1;
} else if (add == 2) {
resultSum.insert(0, 0);
carry = 1;
} else if (add == 1) {
carry = 0;
resultSum.insert(0, 1);
} else {
carry = 0;
resultSum.insert(0, 0);
}
}
if (resultSum.toString().equals("0") && carry == 0)
return resultSum.toString();
if (carry == 0)
return resultSum.toString();
return resultSum.insert(0, carry).toString();
}
private static String equalize(int a, String b) {
String temp = "0";
for (int i = 0; i < (a - b.length() - 1); i++) {
temp = temp + "0";
}
return temp + b;
}
public static void main(String[] args) {
// TODO Auto-generated method stub
String a = "0";
String b = "0";
binaryAddtion(a, b);
}
}