java第二十一天练习

题目如下：

代码如下：

//包
package com.javase.array;
//创建模拟栈的类
public class MyStack {
    Object[] elements;
    int index;

    public MyStack() {
    }

    public MyStack(Object[] elements, int index) {
        this.elements = elements;
        this.index = index;
    }

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

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

    public int getIndex() {
        return index;
    }

    public void setIndex(int index) {
        this.index = index;
    }
    //压栈方法
    public int push(MyStack myStack, Object a){
        if(myStack.getIndex() >= myStack.getElements().length){
            System.out.println("压栈失败");
            return myStack.getIndex();
        }else {
            myStack.getElements()[myStack.getIndex()] = a;
            System.out.println("压栈成功");
            return index += 1;
        }
    }
    //弹栈方法
    public int pop(MyStack myStack){
        if(myStack.getIndex()<1){
            System.out.println("弹栈失败");
            return myStack.getIndex();
        }else{
            myStack.getElements()[index-1] = null;
            System.out.println("弹栈成功");
            return index -= 1;
        }
    }
	//测试程序
    public static void main(String[] args) {
        Object[] array = new Object[3];
        MyStack myStack = new MyStack(array,0);
        Animal a = new Animal();
        Cat c = new Cat();
        Room r = new Room();
        myStack.push(myStack,a);
        myStack.push(myStack,c);
        myStack.push(myStack,r);
        Animal a1 = new Animal();
        myStack.push(myStack,a1);
        for (int i = 0; i < array.length; i++) {
            System.out.println(array[i]);
        }
        System.out.println(myStack.getIndex());
        myStack.pop(myStack);
        for (int i = 0; i < array.length; i++) {
            System.out.println(array[i]);
        }
        myStack.pop(myStack);
        myStack.pop(myStack);
        myStack.pop(myStack);
        for (int i = 0; i < array.length; i++) {
            System.out.println(array[i]);
        }
    }
}
class Animal{

}
class Cat extends Animal{

}
class Room{

}

输出如下图：

修改后代码：

//栈类
public class MyStack {

    private Object[] elements;

    private int index;

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

    public void push(Object obj){
        if(index >= elements.length - 1){
            System.out.println("压栈失败，栈已满！");
            return;
        }
        index++;
        elements[index] = obj;

        System.out.println("压栈" + obj + "元素成功，栈帧指向" + index);
    }

    public void pop(){
        if(index < 0){
            System.out.println("弹栈失败，栈已空！");
            return;
        }
        System.out.print("弹栈" + elements[index] + "元素成功，");
        index--;
        System.out.println("栈帧指向" + index);
    }
    public Object[] getElements() {
        return elements;
    }
    public void setElements(Object[] elements) {
        this.elements = elements;
    }
    public int getIndex() {
        return index;
    }
    public void setIndex(int index) {
        this.index = index;
    }
}

//测试方法
public class MyStackTest {
    public static void main(String[] args) {

        // 创建一个栈对象，初始化容量是10个。
        MyStack stack = new MyStack();

        // 调用方法压栈
        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.pop();
        stack.pop();
        stack.pop();
        stack.pop();
        stack.pop();
        stack.pop();
        stack.pop();
        stack.pop();
        stack.pop();
    }
}