数据结构之栈

package Stack;
public class StackDemo {
    public static void main(String[] args) {
        Stack stack = new Stack(5);
        stack.push(1);
        stack.push(2);
        stack.push(3);
        stack.push(4);
        stack.push(5);
        stack.list();
    }
}
class Stack{
     int stackArray[];
     int maxSize;//栈容量
     int top = -1;//栈顶
    public Stack(int maxSize) {
        this.maxSize = maxSize;
        stackArray = new int[maxSize];
    }
　　//栈满
    public boolean isFull(){
        return top == maxSize - 1;
    }　　//栈空
    public boolean isEmpty(){
        return top == -1;
    }
    //压栈
    public void push(int value){
        if (isFull()){
            System.out.println("栈满");
            return;
        }　　　　　//栈顶指针上移
        top++;
        stackArray[top] = value;
    }
    //出栈
    public int pop(){
        if (isFull()){
            throw new RuntimeException("栈空");
        }　　　　　//临时变量保存栈顶元素
        int value = stackArray[top];　　　　　//指针下移
        top--;
        return value;
    }
    //遍历栈,必须从栈顶开始显示数据
    public void list(){
        if (isEmpty()){
            System.out.println("栈空");
            return;
        }
        for (int i = top ; i >= 0 ; i--){
            System.out.printf("stack[%d]=%d\n",i,stackArray[i]);
        }
    }
}