textstack2.java

来自「it is a good tool to help you study java」· Java 代码 · 共 40 行

//Stack class that use the length array menber
class Stack{
private int stck[];
private int tos;
Stack(int size){
stck=new int[size];
tos=-1;
}
void push (int item){
if(tos==stck.length-1)
System.out.println("Stack is full!");
else 
stck[++tos]=item;
}
int pop(){
if(tos<0){
System.out.println("Stack is underflow!");
return 0;
}
else 
return stck[tos--];
}
}
class TextStack2{
public static void main(String args[]){
Stack mystack1=new Stack(5);
Stack mystack2=new Stack(8);
for(int i=0;i<5;i++)
mystack1.push(i);
for(int i=0;i<8;i++)
mystack2.push(i);
System.out.println("Stack in mystack1");
for(int i=0;i<5;i++)
System.out.println(mystack1.pop());
System.out.println("Stack in mystack2:");
for (int i=0;i<8;i++)
System.out.println(mystack2.pop());
}
}
//数组保存他们自己长度信息的事实使得创建任何大小的堆栈很容易