-
Notifications
You must be signed in to change notification settings - Fork 0
/
MinUsingStack.java
94 lines (75 loc) · 2.12 KB
/
MinUsingStack.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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
import java.util.*;
class MinStk{
private Stack<Integer> aux;
private Stack<Integer> st;
public MinStk(){
st = new Stack<>();
aux = new Stack<>();
}
public void push(int n){
st.add(n);
if(aux.empty()){
aux.push(n);
}
else if(n <= aux.peek()){
aux.push(n);
}
}
public int pop(){
if(st.empty()){
System.out.println("Stack underflow");
return -1;
}
int top = st.pop();
if(top==aux.peek()){
aux.pop();
}
return top;
}
public int min(){
if(aux.isEmpty()){
System.out.println("Stack underlfow");
return -1;
}
return aux.peek();
}
}
public class MinUsingStack {
public static void main(String[] args) {
//Scanner src = new Scanner(System.in);
MinStk s = new MinStk();
s.push(6);
System.out.println(s.min()); // prints 6
s.push(7);
System.out.println(s.min()); // prints 6
s.push(8);
System.out.println(s.min()); // prints 6
s.push(5);
System.out.println(s.min()); // prints 5
s.push(3);
System.out.println(s.min()); // prints 3
s.pop();
System.out.println(s.min()); // prints 5
s.push(10);
System.out.println(s.min()); // prints 5
s.pop();
System.out.println(s.min()); // prints 5
s.pop();
System.out.println(s.min());
//THIS CAN BE DONE LIKE THIS TOO....
// Stack<Integer> stack1 = new Stack<>();
// Stack<Integer> stack2 = new Stack<>();
// System.out.println("How many number you want to enter");
// int t = src.nextInt();
// while(t-->0){
// int n = src.nextInt();
// stack1.add(n);
// if(stack2.isEmpty()){
// stack2.add(n);
// } else if(n < stack2.peek()){
// stack2.add(n);
// }
// }
// System.out.println("Min = "+stack2.peek());
}
}