用队列实现栈

?

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

type MyStack struct {     queue []int }   /** Initialize your data structure here. */ func Constructor() (s MyStack) {     return }   /** Push element x onto stack. */ func (s *MyStack) Push(x int) {     n := len(s.queue)     s.queue = append(s.queue, x)     for ; n > 0; n-- {         s.queue = append(s.queue, s.queue[0])         s.queue = s.queue[1:]     } }   /** Removes the element on top of the stack and returns that element. */ func (s *MyStack) Pop() int {     v := s.queue[0]     s.queue = s.queue[1:]     return v }   /** Get the top element. */ func (s *MyStack) Top() int {     return s.queue[0] }   /** Returns whether the stack is empty. */ func (s *MyStack) Empty() bool {     return len(s.queue) == 0 }