姊妹篇:

leetcode-232 用栈实现队列



225. 用队列实现栈

难度: 简单




已经有部分实现好的代码:

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
type MyStack struct {

}


/** Initialize your data structure here. */
func Constructor() MyStack {

}


/** Push element x onto stack. */
func (this *MyStack) Push(x int) {

}


/** Removes the element on top of the stack and returns that element. */
func (this *MyStack) Pop() int {

}


/** Get the top element. */
func (this *MyStack) Top() int {

}


/** Returns whether the stack is empty. */
func (this *MyStack) Empty() bool {

}


/**
* Your MyStack object will be instantiated and called as such:
* obj := Constructor();
* obj.Push(x);
* param_2 := obj.Pop();
* param_3 := obj.Top();
* param_4 := obj.Empty();
*/


完整代码:

`go