-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTwoStackInOneArray.java
More file actions
164 lines (84 loc) · 3.48 KB
/
TwoStackInOneArray.java
File metadata and controls
164 lines (84 loc) · 3.48 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
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
/**
*
* @author Dell
*/
import java.io.*;
import java.util.*;
public class TwoStackInOneArray {
//declare a new array , with the desired size
int[] A = new int[10];
int mid = A.length / 2;
int counter1 = 0; // counter for stack1
int counter2 = 0; // counter for stack2
int high = -1;
int high2 = mid - 1;
public void push(int e){
if(counter1 == 0 && counter2 == 0){
//if high does not exceeds its limit
if(high < mid){
A[high + 1] = e;
high = high + 1;
counter1 = counter1 + 1;
}
}
else if(counter1 > counter2){
//high2 does not exceeds the array limit
if(high2 < A.length - 1){
A[high2 + 1] = e;
high2 = high2 + 1;
counter2 = counter2 + 1;
}
}
else{
//to check that high does not exceeds the limit
if(high < mid - 1){
A[high + 1] = e;
high = high + 1;
counter1 = counter1 + 1;
}
}
}
public int pop(){
int element = 0;
if(counter1 > counter2){
element = A[high];
high = high - 1;
counter1 = counter1 - 1;
return element;
}
else{
element = A[high2];
high2 = high2 - 1;
counter2 = counter2 - 1;
return element;
}
}
public void print(){
System.out.println("Stack 1::");
for(int i = 0 ; i <= high ; i++){
System.out.print(A[i] + " ");
}
System.out.println("\nStack 2::");
for(int i = mid ; i <= high2; i++){
System.out.print(A[i] + " ");
}
}
public static void main(String[] args){
TwoStackInOneArray tsia = new TwoStackInOneArray();
tsia.push(15);
tsia.push(10);
tsia.push(31);
tsia.push(18);
tsia.push(21);
tsia.push(31);
tsia.print();
tsia.pop();
tsia.pop();
tsia.print();
}
}