-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtwo_stacks.java
More file actions
97 lines (88 loc) · 2.11 KB
/
two_stacks.java
File metadata and controls
97 lines (88 loc) · 2.11 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
85
86
87
88
89
90
91
92
93
94
95
96
97
//this program is to implement two stacks using a sinlge array.
//for this, we r using a space efficient approach by pushing the elements from the extreme corners of the array, which would utilize the array space efficiently.
public class Twoinone
{
int size;
int top1, top2;
int arr[];
//parameterized constructor to assign values to data members
Twoinone(int n)
{
size = n;
arr = new int[n];
top1=-1;
top2=size;
}
//function to push an element in stack1
void push1(int e)
{
if(top1<top2-1)//this checks that there is still space left for stack1
{
top1++;
arr[top1]=e;
}
else
{
System.out.println("Stack is full!!");
System.exit(1); //this exit code indicates unsuccessul termination
}
}
//function to push in stack2
void push2(int e)
{
if(top2>top1+1)
{
top2--;
arr[top2]=e;
}
else
{
System.out.println("Stack is full !!");
System.exit(1);
}
}
//method to pop from stack1
int pop1()
{
if(top1>=0)
{
int x =arr[top1];
top1--;
return x;
}
else
{
System.out.println("Stack is empty!!");
System.exit(1);
}
return 0;
}
int pop2()
{
if(top2<size)
{
int x=arr[top2];
top2++;;
return x;
}
else
{
System.out.println("Stack is empty!!");
System.exit(1);
}
return 0;
}
//finally implementing the main part
public static void main(String args[])
{
Twoinone to = new Twoinone(5);
to.push1(95);
to.push2(97);
to.push2(93);
to.push1(90);
to.push2(96);
System.out.println("Popped element from stack1 : "+to.pop1());
to.push2(95);
System.out.println("Popped element from stack2 : "+to.pop2());
}
}