【java】封装2——封装栈和队列

根据【java】封装1——封装一个超级数组的内容，封装栈和队列

1.封装栈

栈：先进后出
MyStack.java代码

package com.zhl.util;

/**
 * 栈 先进后出
 * 封装一个栈
 */
public class MyStack {
    private superArray superArray;
    public MyStack(){
        superArray = new superArray();
    }
    //压栈 压入栈顶
    public void push(int data){
        superArray.add(data);
    }

    //弹栈
    public Integer pop(){
        Integer number = superArray.delete();
        if(number == null){
            System.out.println("栈为空");
        }
        return number;
    }

}

mystackTest.java代码

package com.zhl.util;

public class mystackTest {
    public static void main(String[] args) {
        MyStack myStack = new MyStack();
        myStack.push(3);
        myStack.push(4);
        myStack.superArray.print();
        System.out.println("\n---------");
        Integer pop = myStack.pop();
        System.out.println(pop);

        Integer pop2 = myStack.pop();
        System.out.println(pop2);

        Integer pop3 = myStack.pop();
        System.out.println(pop3);

    }


}

结果如下

1.封装队列

队列：先进先出
MyQueue.java代码

package com.zhl.util;

/**
 * 先进先出 入队 出队 MyQueue put pop
 */
public class MyQueue {
    superArray superArray;
    public MyQueue(){
        superArray = new superArray();
    }

    //入队
    public void put(int data){
        superArray.add(data);
    }

    //出队
    public Integer pop(){
        Integer number = superArray.deleteIndex(0);
        return number;

    }



}

myqueueTest.java

package com.zhl.util;

public class myqueueTest {
    public static void main(String[] args) {
        MyQueue myQueue = new MyQueue();
        myQueue.put(2);
        myQueue.put(5);

        myQueue.superArray.print();
        System.out.println("\n------------");

        Integer pop = myQueue.pop();
        System.out.println(pop);
        Integer pop1 = myQueue.pop();
        System.out.println(pop1);
        Integer pop2 = myQueue.pop();
        System.out.println(pop2);

    }
}

结果如下