leetcode china . Contribute to lsaejn/leetcode development by creating an account on GitHub.

* Implement the following operations of a stack using queues. * push(x) -- Push element x onto stack. * pop() -- Removes the element on top of the stack. * top() -- Get the top element. * empty() -- ...