数组模拟栈

最新推荐文章于 2025-11-05 13:38:55 发布

原创最新推荐文章于 2025-11-05 13:38:55 发布 · 147 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#栈 #数据结构

数组模拟栈

public class Stack {
    Object[] objects=new Object[5];//创建一个数组
    int index=-1;//栈帧指向-1
    public void  push(Object o) throws StackException {//压榨方法
        if (index>=objects.length-1){ //当栈帧大于数组长度减一手动抛异常
            throw  new StackException("栈已满");
        }
        objects[++index]=o;//添加元素
        System.out.println("压榨"+o+"成功"+",栈帧指向"+index);
    }
    public void pop() throws StackException {//弹栈
        if(index<0){ //当栈帧小于0抛异常
            throw new StackException("栈已空");
        }
        //此处切记不能先将栈帧--，首先得弹出最顶端元素
        System.out.println("弹栈"+objects[index]+"成功"+"栈帧指向"+index);
        index--;
    }
}

public class StackException extends Exception {
    //自定义异常
    public StackException() {
    }

    public StackException(String s) {
        super(s);
    }
}

public class StackTest {
    public static void main(String[] args) throws StackException {
        Stack stack=new Stack();
        stack.push(1);
        stack.push(2);
        stack.push(3);
        stack.push(4);
        stack.push(5);
        stack.push(6);
        stack.pop();
        stack.pop();
        stack.pop();
        stack.pop();
        stack.pop();
        stack.pop();
    }
}
//执行结果
//栈满
压榨1成功,栈帧指向0
压榨2成功,栈帧指向1
压榨3成功,栈帧指向2
压榨4成功,栈帧指向3
压榨5成功,栈帧指向4
Exception in thread "main" com.westore.stack.StackException: 栈已满
	at com.westore.stack.Stack.push(Stack.java:8)
	at com.westore.stack.StackTest.main(StackTest.java:11)
    
//栈空
Exception in thread "main" com.westore.stack.StackException: 栈已空
	at com.westore.stack.Stack.pop(Stack.java:15)
	at com.westore.stack.StackTest.main(StackTest.java:12)