Stack
1
class StackX
2
{
3
private int maxSize;
4
private long[] stackArray;
5
private int top;
6
7
public StackX(int s)
8
{
9
maxSize=s;
10
stackArray=new long[maxSize];
11
top=-1;
12
}
13
14
public void push(long j)
15
{
16
stackArray[++top]=j;
17
}
18
19
public long pop()
20
{
21
return stackArray[top--];
22
}
23
24
public long Peek()
25
{
26
return stackArray[top];
27
}
28
public boolean isEmpty
29
{
30
return top==-1;
31
}
32
public boolean isFull()
33
{
34
return (top==maxSize-1);
35
}
36
}
class StackX2
{3
private int maxSize;4
private long[] stackArray;5
private int top;6
7
public StackX(int s)8
{9
maxSize=s;10
stackArray=new long[maxSize];11
top=-1;12
}13
14
public void push(long j)15
{16
stackArray[++top]=j;17
}18
19
public long pop()20
{21
return stackArray[top--];22
}23
24
public long Peek()25
{26
return stackArray[top];27
}28
public boolean isEmpty29
{30
return top==-1;31
}32
public boolean isFull()33
{34
return (top==maxSize-1);35
}36
}java applet 演示
/Files/wenjie/Stack.rar


浙公网安备 33010602011771号