-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbasic_calculator.go
108 lines (93 loc) · 1.56 KB
/
basic_calculator.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
96
97
98
99
100
101
102
103
104
105
106
107
108
// https://leetcode.com/problems/basic-calculator/
package basic_calculator
func calculate(s string) int {
s = reverse(s)
return calc(s)
}
func calc(st string) int {
bs := []byte(st)
s := NewStack()
for i := 0; i < len(bs); i++ {
// Get number and place in stack
if isNum(bs[i]) {
sum := 0
k := 1
for ; i < len(bs) && isNum(bs[i]); i++ {
sum = sum + int(bs[i]-'0')*k
k *= 10
}
s.Push(sum)
if i >= len(bs) {
break
}
}
// operand and closing parenthesis place in stack
if isOp(bs[i]) || bs[i] == ')' {
s.Push(int(bs[i]))
}
// calc
if bs[i] == '(' {
sum := s.Pop()
for {
op := s.Pop()
if byte(op) == ')' {
s.Push(sum)
break
}
b := s.Pop()
switch byte(op) {
case '+':
sum += b
case '-':
sum -= b
}
}
}
}
ans := s.Pop()
for s.Size() > 0 {
op := s.Pop()
b := s.Pop()
switch byte(op) {
case '+':
ans += b
case '-':
ans -= b
}
}
return ans
}
func reverse(s string) string {
bs := []byte(s)
l := len(bs)
for i := 0; i < len(bs)/2; i++ {
t := bs[i]
bs[i] = bs[l-1-i]
bs[l-1-i] = t
}
return string(bs)
}
func isNum(b byte) bool {
return b >= '0' && b <= '9'
}
func isOp(b byte) bool {
return b == '+' || b == '-' || b == '/' || b == '*'
}
type Stack struct {
data []int
}
func NewStack() *Stack {
return new(Stack)
}
func (s *Stack) Push(v int) {
s.data = append(s.data, v)
}
func (s *Stack) Pop() int {
idx := len(s.data) - 1
v := s.data[idx]
s.data = s.data[:idx]
return v
}
func (s *Stack) Size() int {
return len(s.data)
}