-
Notifications
You must be signed in to change notification settings - Fork 0
/
queue1.java
46 lines (43 loc) · 1.04 KB
/
queue1.java
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
//implementing queues using stacks
import java.util.*;
public class Queueviastack
{
static class Queue
{
static Stack<Integer> s1 = new Stack<Integer>();
static Stack<Integer> s2 = new Stack<Integer>();
static void enQueue(int x)
{
while(!s1.isEmpty())
{
s2.push(s1.pop());
}
s1.push(x);
while(!s2.isEmpty())
{
s1.push(s2.pop());
}
}
static int deQueue()
{
if(s1.isEmpty())
{
System.out.println("Queue is Empty");
System.exit(0);
}
int x=s1.peek();
s1.pop();
return x;
}
}
public static void main(String args[])
{
Queue q = new Queue();
q.enQueue(3);
q.enQueue(6);
q.enQueue(9);
System.out.println(q.deQueue());
System.out.println(q.deQueue());
System.out.println(q.deQueue());
}
}