|
2 | 2 |
|
3 | 3 | importjava.util.Stack; |
4 | 4 |
|
5 | | -/** |
6 | | - * 232. Implement Queue using Stacks |
7 | | - * |
8 | | - * Implement the following operations of a queue using stacks. |
9 | | -
|
10 | | - push(x) -- Push element x to the back of queue. |
11 | | - pop() -- Removes the element from in front of queue. |
12 | | - peek() -- Get the front element. |
13 | | - empty() -- Return whether the queue is empty. |
14 | | -
|
15 | | - Notes: |
16 | | - You must use only standard operations of a stack -- which means only push to top, peek/pop from top, size, and is empty operations are valid. |
17 | | - Depending on your language, stack may not be supported natively. You may simulate a stack by using a list or deque (double-ended queue), as long as you use only standard operations of a stack. |
18 | | - You may assume that all operations are valid (for example, no pop or peek operations will be called on an empty queue). |
19 | | - */ |
20 | 5 | publicclass_232 { |
21 | 6 |
|
22 | 7 | publicstaticclassSolution1 { |
|