-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path155-MinStack.go
More file actions
162 lines (142 loc) · 4.09 KB
/
155-MinStack.go
File metadata and controls
162 lines (142 loc) · 4.09 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
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
package main
// 155. Min Stack
// Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
// Implement the MinStack class:
// MinStack() initializes the stack object.
// void push(int val) pushes the element val onto the stack.
// void pop() removes the element on the top of the stack.
// int top() gets the top element of the stack.
// int getMin() retrieves the minimum element in the stack.
// You must implement a solution with O(1) time complexity for each function.
// Example 1:
// Input
// ["MinStack","push","push","push","getMin","pop","top","getMin"]
// [[],[-2],[0],[-3],[],[],[],[]]
// Output
// [null,null,null,null,-3,null,0,-2]
// Explanation
// MinStack minStack = new MinStack();
// minStack.push(-2);
// minStack.push(0);
// minStack.push(-3);
// minStack.getMin(); // return -3
// minStack.pop();
// minStack.top(); // return 0
// minStack.getMin(); // return -2
// Constraints:
// -2^31 <= val <= 2^31 - 1
// Methods pop, top and getMin operations will always be called on non-empty stacks.
// At most 3 * 10^4 calls will be made to push, pop, top, and getMin.
import "fmt"
type MinStack struct {
stack []int // 栈
minElement int // 用来存放最小元素
}
func Constructor() MinStack {
return MinStack{stack: []int{}}
}
func (this *MinStack) Push(val int) {
// 栈为空时
if len(this.stack) == 0 {
this.minElement = val
this.stack = append(this.stack, val)
} else if val < this.minElement { // 如果入栈值为最小值
this.stack = append(this.stack, 2*val - this.minElement)
this.minElement = val;
} else {
this.stack = append(this.stack,val)
}
}
func (this *MinStack) Pop() {
if this.stack[len(this.stack)-1] < this.minElement {
this.minElement = 2*this.minElement-this.stack[len(this.stack)-1]
}
this.stack = this.stack[:len(this.stack)-1]
}
func (this *MinStack) Top() int {
if this.stack[len(this.stack)-1] < this.minElement {
return this.minElement
}
return this.stack[len(this.stack)-1]
}
func (this *MinStack) GetMin() int {
return this.minElement
}
// 两个数组维护
type MinStack1 struct {
min []int
stack []int
}
func Constructor1() MinStack1 {
return MinStack1{stack:[]int{}}
}
func (this *MinStack1) Push(val int) {
if len(this.min) == 0 || val <= this.GetMin() {
this.min = append(this.min,val)
}
this.stack = append(this.stack,val)
}
func (this *MinStack1) Pop() {
if this.Top() == this.GetMin() {
this.min = this.min[:len(this.min)-1]
}
this.stack = this.stack[:len(this.stack)-1]
}
func (this *MinStack1) Top() int {
return this.stack[len(this.stack)-1]
}
func (this *MinStack1) GetMin() int {
return this.min[len(this.min)-1]
}
/**
* Your MinStack object will be instantiated and called as such:
* obj := Constructor();
* obj.Push(val);
* obj.Pop();
* param_3 := obj.Top();
* param_4 := obj.GetMin();
*/
func main() {
// MinStack minStack = new MinStack();
obj := Constructor()
fmt.Println(obj)
// minStack.push(-2);
obj.Push(-2)
fmt.Println(obj)
// minStack.push(0);
obj.Push(0)
fmt.Println(obj)
// minStack.push(-3);
obj.Push(-3)
fmt.Println(obj)
// minStack.getMin(); // return -3
fmt.Println(obj.GetMin()) // -3
// minStack.pop();
obj.Pop()
fmt.Println(obj)
// minStack.top(); // return 0
fmt.Println(obj.Top()) // 0
// minStack.getMin(); // return -2
fmt.Println(obj.GetMin()) // -2
// MinStack minStack = new MinStack();
obj1 := Constructor1()
fmt.Println(obj1)
// minStack.push(-2);
obj1.Push(-2)
fmt.Println(obj1)
// minStack.push(0);
obj1.Push(0)
fmt.Println(obj1)
// minStack.push(-3);
obj1.Push(-3)
fmt.Println(obj1)
// minStack.getMin(); // return -3
fmt.Println(obj1.GetMin()) // -3
// minStack.pop();
obj1.Pop()
fmt.Println(obj1)
// minStack.top(); // return 0
fmt.Println(obj1.Top()) // 0
// minStack.getMin(); // return -2
fmt.Println(obj1.GetMin()) // -2
}