数组模拟队列以及环形队列_java实现

数组

模拟队列 以及 数组模拟环形队列

代码部分

package com.zhangan.queue;


import java.util.Scanner;

public class ArrayQueueDemo {

    public static void main(String[] args) {
        ArrayQueue queueDemo = new ArrayQueue(3);
        char key = ' ';//接收用户输入
        Scanner scanner = new Scanner(System.in);
        boolean loop = true;

        //输出一个菜单
        while (loop) {
            System.out.println("1(show):显示队列");
            System.out.println("2(exit):退出程序");
            System.out.println("3(add):添加数据到队列");
            System.out.println("4(get):取出数据");
            System.out.println("5(head):查看队列头数据");
            System.out.println();
            key = scanner.next().charAt(0);//接收一个字符

            switch (key) {

                case '1':
                    queueDemo.show();
                    break;
                case '2':
                    scanner.close();
                    loop = false;
                    break;
                case '3':
                    System.out.println("添加的数为:");
                    int value = scanner.nextInt();
                    queueDemo.addQueue(value);
                    break;
                case '4':
                    try {
                        int queue = queueDemo.getQueue();
                        System.out.println("取出的数据为:" + queue);
                    } catch (Exception e) {
                        System.out.println(e.getMessage());
                    }
                    break;
                case '5':
                    try {
                        int headQueue = queueDemo.headQueue();
                        System.out.println("头部的数据为:" + headQueue);
                    } catch (Exception e) {
                        System.out.println(e.getMessage());
                    }
                    break;
                default:
                    break;
            }
        }

        System.out.println("程序退出");
    }


}

/**
 * 数组存放数据，模拟队列
 */
class ArrayQueue {

    private int maxSize;//数组最大容量
    private int front;//队列头
    private int rear;//队列尾
    private int[] arr;//数组存放数据，模拟队列

    //创建队列
    public ArrayQueue(int arrMaxSize) {
        maxSize = arrMaxSize;
        front = -1;//指向队列头部，front是指向队列头的前一个位置
        rear = -1;//指向队列尾,指向队列尾的数据(即就是队列最后一个数据)
        arr = new int[maxSize];
    }

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

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

    //添加数据到队列
    public void addQueue(int n) {

        if (isFull()) {
            System.out.println("队列已满，无法添加");
            return;

        }
        rear++;
        arr[rear] = n;
    }

    //出队列
    public int getQueue() {
        if (isEmpty()) {
            throw new RuntimeException("队列空，无数据");
        }
        front++;
        return arr[front];
    }

    //展示所有数据
    public void show() {
        if (isEmpty()) {
            System.out.println("队列空,无数据");
            return;
        }
        for (int i = 0; i < arr.length; i++) {
            System.out.printf("arr[%d]=%d\n", i, arr[i]);

        }
//
//        for (int i = front + 1; i <= rear; i++) {
//            System.out.printf("arr[%d]=%d\n", i, arr[i]);
//        }

    }

    //展示队列的头数据
    public int headQueue() {
        if (isEmpty()) {
            throw new RuntimeException("队列空，无数据");
        }

        return arr[front + 1];
    }
}

package com.zhangan.queue;

import java.util.Scanner;

public class CircleArrayQueueDemo {

    public static void main(String[] args) {
        CircleArrayQueue queueDemo = new CircleArrayQueue(4);//实际可存放数据个数是3  约定了一个空的空间
        char key = ' ';//接收用户输入
        Scanner scanner = new Scanner(System.in);
        boolean loop = true;

        //输出一个菜单
        while (loop) {
            System.out.println("-----数组模拟环形队列-----");
            System.out.println("1(show):显示队列");
            System.out.println("2(head):查看队列头数据");
            System.out.println("3(add):添加数据到队列");
            System.out.println("4(get):取出数据");
            System.out.println("5(exit):退出程序");
            System.out.println("-------------------------");

            key = scanner.next().charAt(0);//接收一个字符

            switch (key) {

                case '1':
                    queueDemo.show();
                    break;
                case '5':
                    scanner.close();
                    loop = false;
                    break;
                case '3':
                    System.out.println("添加的数为:");
                    int value = scanner.nextInt();
                    queueDemo.addQueue(value);
                    break;
                case '4':
                    try {
                        int queue = queueDemo.getQueue();
                        System.out.println("取出的数据为:" + queue);
                    } catch (Exception e) {
                        System.out.println(e.getMessage());
                    }
                    break;
                case '2':
                    try {
                        int headQueue = queueDemo.headQueue();
                        System.out.println("头部的数据为:" + headQueue);
                    } catch (Exception e) {
                        System.out.println(e.getMessage());
                    }
                    break;
                default:
                    break;
            }
        }

        System.out.println("程序退出");
    }
}

/**
 * 数组存放数据，模拟队列
 */
class CircleArrayQueue {

    private int maxSize;//数组最大容量
    private int front;//队列头
    private int rear;//队列尾
    private int[] arr;//数组存放数据，模拟队列

    //创建队列
    public CircleArrayQueue(int arrMaxSize) {
        maxSize = arrMaxSize;
        front = 0;//指向队列头部，front是指向队列头
        rear = 0;//指向队列尾的后一个位置，约定空出一个空间
        arr = new int[maxSize];
    }

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

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

    //添加数据到队列
    public void addQueue(int n) {

        if (isFull()) {
            System.out.println("队列已满，无法添加");
            return;

        }
        arr[rear] = n;
        rear = (rear + 1) % maxSize;
    }

    //出队列
    public int getQueue() {
        if (isEmpty()) {
            throw new RuntimeException("队列空，无数据");
        }
        int value = arr[front];
        front = (front + 1) % maxSize;
        return value;
    }

    //展示所有数据
    public void show() {
        if (isEmpty()) {
            System.out.println("队列空,无数据");
            return;
        }

        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() {
        if (isEmpty()) {
            throw new RuntimeException("队列空，无数据");
        }

        return arr[front];
    }
}