练习题:数组模拟栈数据结构

package com.javase.advanced.work02;

/*  1.栈可以存储java中任何引用类型的数据
    2.提供push方法压栈(栈满
    3.提供pop方法弹栈(栈空
    4.编写测试程序,new栈对象,调用push pop方法模拟压栈弹栈动作
    5.默认初始化容量是10(无参数

*/
public class Stack {
    //Object 父类 可以存储任何引用类型
    private Object[] elements;
    private int index;

    public Stack() {
        this.elements = new Object[10];
        this.index = -1;
    }

    public Object[] getElements() {
        return elements;
    }

    public void setElements(Object[] elements) {
        this.elements = elements;
    }

    public void push(Object o) {
        if (index >= elements.length - 1) {
            System.out.println("栈满,压栈失败");
            return;
        }
        /*思维?
        elements[index + 1] = o;
        index++;
         */
        elements[++index] = o;
        System.out.println("压栈" + o + "成功,栈帧指向" + index);

    }

    public void pop() {
        if (index < 0) {
            System.out.println("栈空,弹栈失败");
            return;
        }
        System.out.print("弹栈" + elements[index] + "元素成功,");
        elements[index--] = null;//思考?
        //index--;
        System.out.println("栈帧指向" + index);
    }

    public void traversal() {
        for (int i = 0; i <= elements.length - 1; i++) {
            System.out.print(elements[i] + "     ");
        }
        System.out.println();
    }
}
//还是开始没思路,读答案一半才写出来


```java
ackage com.javase.advanced.work02;

public class Test01 {
    public static void main(String[] args) {
        Stack stack = new Stack();
        stack.pop();
        stack.pop();
        stack.push(new Object());
        stack.push(new Object());
        stack.push(new Object());
        stack.push(new Object());
        stack.push(new Object());
        stack.push(new Object());
        stack.push(new Object());
        stack.push(new Object());
        stack.push(new Object());
        stack.push(new Object());
        stack.push(new Object());
        stack.pop();
        stack.pop();
        stack.traversal();
        //System.out.println(stack.getElements());
        // String[] array = {"1", "2", "3", "4", "7"};
        // stack.setElements(array);


    }
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值