-
Notifications
You must be signed in to change notification settings - Fork 0
/
StackEg.java
62 lines (52 loc) · 1.23 KB
/
StackEg.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
public class StackEg {
int array[];
int top;
int capacity;
StackEg(int size){
array = new int[size];
top =-1;
capacity = size;
}
public void push(int data){
if(isFull()){
System.out.println("Stack overlfow");
System.exit(1);
}
array[++top] = data;
}
public int pop(){
if(isEmpty()){
System.out.println("Stack is empty");
System.exit(1);
}
return array[top--];
}
public int getSize(){
return top+1;
}
public boolean isFull(){
return top == capacity-1;
}
public boolean isEmpty(){
return top == -1;
}
public void printStack(){
for(int i=0;i<=top;i++){
System.out.println(array[i]);
}
}
public static void main(String[] args) {
StackEg stack = new StackEg(5);
stack.push(5);
stack.push(15);
stack.push(25);
stack.push(45);
stack.push(33);
System.out.println("Stack: ");
stack.printStack();
int x = stack.pop();
int y = stack.pop();
System.out.println("Stack After POP: "+ x+" "+y);
stack.printStack();
}
}