c# LeetCode 232. 用栈实现队列

原题链接：https://leetcode-cn.com/problems/implement-queue-using-stacks/

public class MyQueue {
private Stack<int> _stack = null;
		/** Initialize your data structure here. */
		public MyQueue()
		{
			_stack = new Stack<int>();
		}

		/** Push element x to the back of queue. */
		public void Push(int x)
		{
			var stack = new Stack<int>();
			stack.Push(x);
			var reverse = _stack.Reverse().ToList();
			foreach (var elemet in reverse)
			{
				stack.Push(elemet);
			}
			_stack = stack;
		}

		/** Removes the element from in front of queue and returns that element. */
		public int Pop()
		{
			return _stack.Pop();
		}

		/** Get the front element. */
		public int Peek()
		{
			return _stack.Peek();
		}

		/** Returns whether the queue is empty. */
		public bool Empty()
		{
			return _stack.Count == 0;
		}
}

/**
 * Your MyQueue object will be instantiated and called as such:
 * MyQueue obj = new MyQueue();
 * obj.Push(x);
 * int param_2 = obj.Pop();
 * int param_3 = obj.Peek();
 * bool param_4 = obj.Empty();
 */

参考：https://blog.csdn.net/qq_31116753/article/details/83213529