-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.go
More file actions
107 lines (97 loc) · 1.4 KB
/
main.go
File metadata and controls
107 lines (97 loc) · 1.4 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
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
96
97
98
99
100
101
102
103
104
105
106
107
package main
import (
"log"
)
/*
*
*
* fullAdder
*
* args :
* c1, c2 byte
* flag bool
*
*
* return value:
* byte, bool
*
*
*/
func fullAdder(c1, c2 byte, flag bool) (byte, bool) {
switch {
case c1 == '1' && c2 == '1':
if flag {
return '1', flag
} else {
return '0', true
}
case c1 != c2:
if flag {
return '0', flag
} else {
return '1', false
}
default:
if flag {
return '1', false
} else {
return '0', false
}
}
}
/*
*
*
* add Binary
*
* args :
* a, b string
*
*
* return value:
* string
*
*
*/
func addBinary(a, b string) string {
var (
ans, c1, c2 byte
res string
flag bool
i int
)
for ; i < len(a) && i < len(b); i++ {
c1, c2 = a[len(a)-(1+i)], b[len(b)-(1+i)]
ans, flag = fullAdder(c1, c2, flag)
res = string(ans) + res
}
for ; i < len(a); i++ {
if flag {
c1 = a[len(a)-(1+i)]
ans, flag = fullAdder(c1, '0', flag)
res = string(ans) + res
continue
}
res = string(a[len(a)-(1+i)]) + res
}
for ; i < len(b); i++ {
if flag {
c1 = b[len(b)-(1+i)]
ans, flag = fullAdder(c1, '0', flag)
res = string(ans) + res
continue
}
res = string(b[len(b)-(1+i)]) + res
}
if flag {
return "1" + res
}
return res
}
func main() {
// simple test
if ans := addBinary("11", "1"); ans != "100" {
log.Fatalf("Worn Answer! answer equal `100` not equal : %v", ans)
}
log.Println("Answer is True!")
}