-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQueueUsingStack.java
More file actions
55 lines (48 loc) · 1.27 KB
/
QueueUsingStack.java
File metadata and controls
55 lines (48 loc) · 1.27 KB
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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
import java.util.Stack;
public class QueueUsingStack {
static class Queue {
private Stack<Integer> s = new Stack<>();
void enqueue(int x) {
s.push(x);
}
int dequeue() {
if(s.isEmpty()) {
System.out.println("Queue is empty");
return -1;
}
int x = s.pop();
if(s.isEmpty())
return x;
int item = dequeue();
s.push(item);
return item;
}
int front() {
if(s.isEmpty()) {
System.out.println("Queue is empty");
return -1;
}
int x = s.pop();
if(s.isEmpty()) {
s.push(x);
return x;
}
int item = front();
s.push(item);
return item;
}
int size() {
return s.size();
}
}
public static void main(String[] args) {
Queue q = new Queue();
q.enqueue(10);
q.enqueue(20);
q.enqueue(50);
System.out.println("Front:"+q.front());
System.out.println("Dequeue:"+q.dequeue());
System.out.println("Front:"+q.front());
System.out.println("Size:"+q.size());
}
}