-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathstackarray.java
61 lines (59 loc) · 871 Bytes
/
stackarray.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
import java.util.Stack;
public class stackarray {
int MAX = 1000;
int top;
int a[]= new int[MAX];
public stackarray()
{
top = -1;
}
public boolean push(int x)
{
if(top>MAX)
{
System.out.println("STACK OVERFLOW");
return false;
}
else
{
a[++top] = x;
System.out.println("Pushed "+x+" into the stack");
return true;
}
}
public int pop()
{
if(top<0)
{
System.out.println("STACK UNDERFLOW");
return 0;
}
else
{
int x = a[top--];
return x;
}
}
public int peek()
{
if(top<0)
{
System.out.println("STACK UNDERFLOW");
return 0;
}
else
{
int x = a[top];
return x;
}
}
public static void main(String args[])
{
Stack<Integer> s = new Stack<Integer>();
s.push(10);
s.push(20);
s.push(30);
System.out.println("Popping "+s.pop());
System.out.println("Peeking "+s.peek());
}
}