-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdesign.go
61 lines (50 loc) · 924 Bytes
/
design.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
package top_interview_questions_easy
// Problem: Min Stack.
type MinStack struct {
data []item
}
type item struct {
value int
min int
}
func Constructor() MinStack {
return MinStack{}
}
func (s *MinStack) Push(val int) {
min := 0
if len(s.data) > 0 {
lastItem := s.data[len(s.data)-1]
if val < lastItem.min {
lastItem.min = val
min = val
} else {
min = lastItem.min
}
} else {
min = val
}
s.data = append(s.data, item{value: val, min: min})
}
func (s *MinStack) Pop() int {
if len(s.data) == 0 {
return 0
}
last := s.data[len(s.data)-1]
s.data = s.data[:len(s.data)-1]
return last.value
}
func (s *MinStack) Top() int {
if len(s.data) == 0 {
return 0
}
lastItem := s.data[len(s.data)-1]
return lastItem.value
}
func (s *MinStack) GetMin() int {
if len(s.data) == 0 {
return 0
}
lastItem := s.data[len(s.data)-1]
return lastItem.min
}
// End of Problem: Min Stack.