【Java手写数据结构】队列、单链表、双链表、

数组实现队列

package com.fly.arrayQueue;

import java.util.Scanner;

/**
 * @Title: 数组队列
 * @author: Fly
 * @date: 2020/4/22 - 23:29
 */
public class ArrayQueue {
    public static void main(String[] args) {
        ArrayQueueDemo arrayQueueDemo = new ArrayQueueDemo(4);
        char key=' ';
        Scanner scanner = new Scanner(System.in);
        boolean loop=true;
        while (loop){
            System.out.println("s:显示队列");
            System.out.println("e:退出队列");
            System.out.println("a:添加数据队列");
            System.out.println("g:取出数据");
            System.out.println("h:显示头");
            key = scanner.next().charAt(0);//接收一个字符
            switch (key){
                case 's':
                    arrayQueueDemo.showQueue();
                    break;
                case 'a':
                    System.out.println("输入一个整数：");
                    int value = scanner.nextInt();
                    arrayQueueDemo.addQueue(value);
                    break;
                case 'g':
                    try {
                        int res=arrayQueueDemo.getQueue();
                        System.out.println("取出的数据是："+res);
                    }catch (Exception e){
                        System.out.println(e.getMessage());
                    }
                    break;
                case 'h':
                    try {
                        System.out.println("队列头的数据：");
                        arrayQueueDemo.showHead();
                    }catch (Exception e){
                        System.out.println(e.getMessage());
                    }
                    break;
                case 'e':
                    System.out.println("程序退出！");
                    scanner.close();
                    loop=false;
                    break;
                 default:
                        break;
            }
        }


    }
    static class ArrayQueueDemo{
        public int maxSize;
        public int front;
        public int rear;
        public int[] arr;

        public ArrayQueueDemo(int arrMaxSize){
            maxSize=arrMaxSize;
            front=-1;//指向队列的头部
            rear=-1;//指向队列的尾部
            arr=new int[arrMaxSize];
        }

        //判断队列是否满
        public boolean isFull(){
            return rear==maxSize-1;
        }

        //判断是否为空
        public boolean isEmpty(){
            return front==rear;
        }

        //添加数据到队列
        public void addQueue(int n){
            if (isFull()==true){
                System.out.println("队列已满");
            }
            rear++;
            arr[rear]=n;
        }

        //数据出队列
        public int getQueue(){
            if (isEmpty()==true){
                System.out.println("队列为空");
                throw  new RuntimeException("队列为空");
            }
            front++;
            int res=arr[front];
            arr[front]=0;
            return res;
        }
        //显示队列
        public void showQueue(){
            if (isEmpty()){
                System.out.println("队列为空,无法遍历");
            }else {
             for (int i = 0; i < arr.length; i++) {
                System.out.print(arr[i]+",");
             }
                System.out.println("");
            }
        }

        //显示头
        public void showHead(){
            if (isEmpty()==true){
                System.out.println("队列为空");
                throw  new RuntimeException("队列为空");
            }
            System.out.println(arr[front+1]);
        }
    }
}

数组实现环形队列

package com.fly.arrayQueue;

/**
 * @Title:数组模拟环型队列
 * @author: fly
 * @date: 2020-3-13
 */
public class CircleArrayQueueDemo {

    public static void main(String[] args) {
        CircleArrayQueue circleArrayQueue = new CircleArrayQueue(4);//有效队列空间是3
        circleArrayQueue.add(1);
        circleArrayQueue.all();
        circleArrayQueue.add(2);
        circleArrayQueue.all();
        circleArrayQueue.add(3);
        System.out.println(circleArrayQueue.get());
//        circleArrayQueue.add(4);
        System.out.println(circleArrayQueue.headQueue());
        System.out.println(circleArrayQueue.lastQueue());
        circleArrayQueue.all();
    }

    static class CircleArrayQueue {
        private int MaxSize;
        private int rear;
        private int front;
        private int[] arr;


        public CircleArrayQueue(int maxSize) {
            MaxSize = maxSize;
            arr = new int[maxSize];
            //其实默认也是为0
            rear = 0;
            front = 0;
        }

        //判断是否满了
        public boolean isFull() {
//            return rear%MaxSize+1 ==front;
            return (rear + 1) % MaxSize == front;
            //抽象理解一下max_size=4时，头f=1，尾r=4也就是要模%4才等于0，也就是占满了，所以r+1模4就是1表示满了
        }

        //判断是否为空
        public boolean isEmpty() {
            return rear == front;
        }

        //添加
        public void add(int n) {
            if (isFull()) {
                throw new RuntimeException("满啦");
            }else {
            arr[rear] = n;
            rear = (rear + 1) % MaxSize;//用脑子理解！！！记住！！！下一次要插入的index
            System.out.println(rear+","+front);
            }
        }

        //取出
        public int get() {
            if (isEmpty()) {
                throw new RuntimeException("The Queue is Empty！");
            }
            int frontBottle = arr[front];
            front = (front + 1) % MaxSize;//用脑子理解！！！记住！！！
            return frontBottle;
        }

        //遍历
        public void all() {
            if (isEmpty()) {
                throw new RuntimeException("The Queue is Empty！");
            }
            for (int i = front; i < (front +size()); i++) {//用脑子理解！！！记住！！！
                System.out.printf("arr[%d]:%d\n", i%MaxSize, arr[i%MaxSize]);
            }
        }
        public int size(){
            return (rear+MaxSize-front)%MaxSize;
        }

        //第一个
        public int headQueue() {
            return arr[front];
        }

        //最后一个
        public int lastQueue() {
            return arr[rear-1];
        }
    }
}