forked from TonnyL/Windary
-
Notifications
You must be signed in to change notification settings - Fork 0
/
AddBinary.go
95 lines (86 loc) · 1.35 KB
/
AddBinary.go
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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
package AddBinary
//Given two binary strings, return their sum (also a binary string).
//
//For example,
//a = "11"
//b = "1"
//Return "100".
//
//Accepted.
func addBinary(a string, b string) string {
aLength, bLength := len(a), len(b)
if aLength == 0 {
return b
}
if bLength == 0 {
return a
}
flag := false
longer := []byte(a)
if bLength > aLength {
longer = []byte(b)
}
shorter := []byte(b)
if aLength < bLength {
shorter = []byte(a)
}
result := ""
var i = len(longer) - 1
var j = len(shorter) - 1
for ; i >= 0; {
if j < 0 {
if longer[i] == '1' {
if flag {
result += "0"
} else {
result += "1"
}
} else {
if flag {
result += "1"
flag = false
} else {
result += "0"
}
}
} else {
if longer[i] == '1' && shorter[j] == '1' {
if flag {
result += "1"
} else {
result += "0"
}
flag = true
} else if longer[i] == '0' && shorter[j] == '0' {
if flag {
result += "1"
} else {
result += "0"
}
flag = false
} else {
if flag {
result += "0"
flag = true
} else {
result += "1"
}
}
}
i -= 1
j -= 1
}
if flag {
result += "1"
}
return reverse(result)
}
func reverse(s string) string {
n := len(s)
runes := make([]rune, n)
for _, r := range s {
n--
runes[n] = r
}
return string(runes[n:])
}