leetcode 探索 队列与栈 用队列实现栈

题目

使用队列实现栈的下列操作：

push(x) – 元素 x 入栈
pop() – 移除栈顶元素
top() – 获取栈顶元素
empty() – 返回栈是否为空

分析

用go里的slice就好了。

解法

type MyStack struct {
    Space []int
}


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


/** Push element x onto stack. */
func (this *MyStack) Push(x int)  {
    this.Space = append(this.Space, x)
}


/** Removes the element on top of the stack and returns that element. */
func (this *MyStack) Pop() int {
    pop := this.Space[len(this.Space)-1]
    this.Space = this.Space[:len(this.Space)-1]
    return pop
}


/** Get the top element. */
func (this *MyStack) Top() int {
    pop := this.Space[len(this.Space)-1]
    return pop
}


/** Returns whether the stack is empty. */
func (this *MyStack) Empty() bool {
    return len(this.Space) == 0
}


/**
 * 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();
 */