Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
36 lines (30 loc) · 719 Bytes

File metadata and controls

36 lines (30 loc) · 719 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
36
public class queueWithStack {
Stack<Integer> inbox = new Stack<Integer>();
Stack<Integer> outbox = new Stack<Integer>();
//push element x to the back of queue
public void push(int x) {
inbox.push(x);
}
//removes the element from in front of queue
public void pop() {
if (outbox.isEmpty()) {
while(!inbox.isEmpty()){
outbox.push(inbox.pop());
}
}
outbox.pop();
}
//get the front element.
public int peek() {
if (outbox.isEmpty()){
while(!inbox.isEmpty()){
outbox.push(inbox.pop());
}
}
outbox.peek();
}
//return whether the queue is empty.
public boolean empty() {
return inbox.isEmpty() && outbox.isEmpty();
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.