栈学习简单小例子

public class ArrayStrack {
private long[] strack;
private int maxLength;
private int topIndex;
public ArrayStrack(int maxLength) {
this.strack = new long[maxLength];
this.maxLength = maxLength;
this.topIndex = -1;
}
public void push(long item){
this.strack[++topIndex] = item;
}
public long pop(){
return this.strack[topIndex--];
}
public long peek(){
return this.strack[topIndex];
}
public boolean isFull(){
return this.topIndex==maxLength-1;
}
public boolean isEmpty(){
return this.topIndex==-1;
}

public static void main(String[] ssss){
ArrayStrack strack = new ArrayStrack(5);
strack.push(1);
strack.push(2);
strack.push(3);
strack.push(4);
strack.push(5);
System.out.println(strack.peek());
System.out.println(strack.pop());
System.out.println(strack.pop());
System.out.println(strack.pop());
System.out.println(strack.pop());
System.out.println(strack.pop());
System.out.println("=========================");
int index=10;
while(!strack.isFull()){
strack.push(index--);
}
while(!strack.isEmpty()){
System.out.println(strack.pop());
}

}


}
[align=center][/align][align=center][/align]