【第4节】栈的Java代码实现,【数组形式存储】

package com.java.chapterFour;

public class StackApp {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Stack stack=new Stack(10);
stack.push(2);
stack.push(4);
stack.push(6);
stack.push(8);
stack.push(10);
while(!stack.isEmpty()){
long value=stack.pop();
System.out.print(value+" ");
}
System.out.println(" ");
}

}
class Stack{
private int MaxSize;
private long[] stackArray;
private int top;

Stack(int s){
MaxSize=s;
stackArray=new long[s];
top=-1;
}
//入栈
public void push(long j){
stackArray[++top]=j;                    //先将top增加1之后，然后放入数据
}
//出栈
public long  pop(){
return stackArray[top--];
}
//返回当前站定元素
public long peek(){
return stackArray[top];
}
//判断栈是否为空
public boolean isEmpty(){
return (top==-1);
}
//判断栈是否已满
public boolean isFull(){
return (top==MaxSize-1);
}
}