LintCode

LintCode

Implement Queue by Two Stacks

LintCode-40.Implement Queue by Two Stacks As the title described, you should only use two stacks to implement a queue's actions. The queue should support push(element), pop() and top() where pop is pop the first(a.k.a front) element in the queue. Both pop and top

LintCode

Implement Stack by Two Queues

LintCode-494.Implement Stack by Two Queues Implement a stack by two queues. The queue is first in first out (FIFO). That means you can not directly pop the last element in a queue. For this question, you need to pay attention to the push(int x) method. class Stack { Queue&