-
Notifications
You must be signed in to change notification settings - Fork 14
Expand file tree
/
Copy pathstack implementation
More file actions
90 lines (64 loc) · 1.04 KB
/
stack implementation
File metadata and controls
90 lines (64 loc) · 1.04 KB
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
package javadsa;
public class stackimpl {
int[] arr=new int[5];
int top=0;
public static void main(String[] args) {
stackimpl s=new stackimpl();
s.push(2);
s.push(11);
s.push(12);
s.push(9);
s.push(1);
// s.push(12);
s.print();
System.out.println(" ");
// s.pop();
s.pop();
s.pop();
s.push(12);
s.push(1332);
s.print();
s.peek();
s.pop();
s.print();
s.peek();
}
public void push(int data)
{
try {
arr[top]=data;
top++;
}
catch( ArrayIndexOutOfBoundsException e)
{
System.out.println("Stack overflow for data " + data + " exceed size " +arr.length);
}
}
public void pop()
{
if(top==0)
{
System.out.println(" Nothing to pop ");
return;
}
System.out.println();
System.out.println(" poped element " +arr[top-1] );
top--;
}
void peek()
{
if(top==0)
{
System.out.println(" Empty stack ");
return;
}
System.out.println(" peek element " +arr[top-1] );
}
public void print()
{
for(int i=top-1;i>=0;i--)
{
System.out.println(arr[i]);
}
}
}