-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathQbyStack.java
54 lines (46 loc) · 1.09 KB
/
QbyStack.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
47
48
49
50
51
52
53
54
import java.util.*;
public class QbyStack {
static class Queue{
static Stack<Integer> s1=new Stack<>();
static Stack<Integer> s2=new Stack<>();
public static boolean isEmpty(){
return s1.isEmpty();
}
public static void add(int data){
while(!s1.isEmpty()){
s2.push(s1.pop());
}
s1.push(data);
while(!s2.isEmpty()){
s1.push(s2.pop());
}
}
public static int remove(){
if(isEmpty()){
System.out.print("queue is empty");
return -1;
}
return s1.pop();
}
public static int peek(){
if(isEmpty()){
System.out.print("queue is empty");
return -1;
}
return s1.peek();
}
}
public static void main(String[] args) {
Queue q=new Queue();
q.add(1);
q.add(2);
q.add(3);
q.add(4);
q.add(5);
while(!q.isEmpty())
{
System.out.println(q.peek());
q.remove();
}
}
}