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

今天药忘吃喽~ 2022-11-25 11:54 159阅读 0赞

## 根据[【java】封装1——封装一个超级数组][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);
    
        }
    
    
    }

**结果如下**  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjAxNDYyMg_size_16_color_FFFFFF_t_70]

### 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);
    
        }
    }

**结果如下**  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjAxNDYyMg_size_16_color_FFFFFF_t_70 1]

[java_1]: https://blog.csdn.net/weixin_42014622/article/details/107885601
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjAxNDYyMg_size_16_color_FFFFFF_t_70]: /images/20221124/e5d6f83ceae3427ea26886eab8ee881a.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjAxNDYyMg_size_16_color_FFFFFF_t_70 1]: /images/20221124/db57ef9070684ca195eed06ae234f6ab.png