数组模拟队列代码实现

数组模拟队列

package com.sparsearray;

import java.util.Scanner;

public class ArrrayQueueDemo {
    public static void main(String[] args) {
        ArrayQueue arrayQueue = new ArrayQueue(3);
        char key =' ';//接收用户输入
        Scanner scanner = new Scanner(System.in);
        boolean loop = true;
        while (loop){
            System.out.println("s(show)：显示队列");
            System.out.println("e（eixt）：退出程序");
            System.out.println("a（add):添加队列");
            System.out.println("g（get）:从队列取出数据");
            System.out.println("h(head):查看队列头的数据");
            key =scanner.next().charAt(0);//接收一个字符
            switch (key){
                case 's':
                    arrayQueue.showQueue();
                    break;
                case 'a':
                    System.out.println("输出一个数");
                    int value =scanner.nextInt();
                    arrayQueue.addQueue(value);
                    break;
                case 'g':
                    try {
                        int res = arrayQueue.getQueue();
                        System.out.printf("取出的数据是%d\n",res);
                    } catch (Exception e) {
                        System.out.println(e.getMessage());
                    }
                    break;
                case 'h':
                    try {
                        int res = arrayQueue.headQueue();
                        System.out.printf("队头%d\n",res);
                    } catch (Exception e) {
                        throw new RuntimeException(e);
                    }
                    break;
                case 'e':
                    scanner.close();
                    break;
                default:
                    break;

            }
        }
    }
}

//数组模拟队列
class ArrayQueue{
    //表示数组的最大容量
    private int maxSize;
    //队头
    private int front;
    //对尾
    private int rear;
    //该数据用于存放数据，模拟队列
    private int[] arr;
    //创建队列的构造器
    public ArrayQueue(int arrMaxSize){
        maxSize =arrMaxSize;
        arr = new int[maxSize];
        front = -1; //指向队列头部
        rear = -1;//指向队尾

    }
    //判断队列是否满

    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()){
            System.out.println("队列空，不能取数据");
            throw new RuntimeException("队列空，不能取数据");
        }
        front++;
        return arr[front];
    }
    //显示队列的所有数据
    public void showQueue(){
        //遍历
        if (isEmpty()){
            System.out.println("队列空的，没有数据");
            return;
        }
        for (int i= 0;i<arr.length;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.sparsearray;

import java.util.Scanner;

public class CircleArray {
    public static void main(String[] args) {
        System.out.println("测试数组环形队列");
        CircleArrayQueue arrayQueue = new CircleArrayQueue(3);

        char key =' ';//接收用户输入
        Scanner scanner = new Scanner(System.in);
        boolean loop = true;
        while (loop){
            System.out.println("s(show)：显示队列");
            System.out.println("e（eixt）：退出程序");
            System.out.println("a（add):添加队列");
            System.out.println("g（get）:从队列取出数据");
            System.out.println("h(head):查看队列头的数据");
            key =scanner.next().charAt(0);//接收一个字符
            switch (key){
                case 's':
                    arrayQueue.showQueue();
                    break;
                case 'a':
                    System.out.println("输出一个数");
                    int value =scanner.nextInt();
                    arrayQueue.addQueue(value);
                    break;
                case 'g':
                    try {
                        int res = arrayQueue.getQueue();
                        System.out.printf("取出的数据是%d\n",res);
                    } catch (Exception e) {
                        System.out.println(e.getMessage());
                    }
                    break;
                case 'h':
                    try {
                        int res = arrayQueue.headQueue();
                        System.out.printf("队头%d\n",res);
                    } catch (Exception e) {
                        throw new RuntimeException(e);
                    }
                    break;
                case 'e':
                    scanner.close();
                    break;
                default:
                    break;

            }
        }




    }
}
//数组模拟队列
class CircleArrayQueue{
    //表示数组的最大容量
    private int maxSize;
    //队头
    private int front;
    //对尾
    private int rear;
    //该数据用于存放数据，模拟队列
    private int[] arr;
    //创建队列的构造器
    public CircleArrayQueue(int arrMaxSize){
        maxSize =arrMaxSize;
        arr = new int[maxSize];
        front = 0; //指向队列头部
        rear = 0;//指向队尾

    }
    //判断队列是否满

    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 = (rear + 1) % maxSize;
    }

    //获取队列数据
    public int getQueue(){
        //判断队列是否空
        if (isEmpty()){
            System.out.println("队列空，不能取数据");
            throw new RuntimeException("队列空，不能取数据");
        }
       //分析front是指向队列的第一个元素
        //1.先把front对应的值保留到一个临时变量
        //2.将front后移，考虑取莫
        //3.将临时保存的变量返回
        int value = arr[front];
        front = (front+1)%maxSize;
        return value;

    }
    //显示队列的所有数据
    public void showQueue(){
        //遍历
        if (isEmpty()){
            System.out.println("队列空的，没有数据");
            return;
        }
//        for (int i= 0;i<arr.length;i++){
//            System.out.printf("arr[%d]=%d\n",i,arr[i]);
//        }
        //思路：从front开始遍历，遍历多少个元素
        for (int i = front;i<front+size();i++){
            System.out.printf("arr[%d]=%d\n",i%maxSize,arr[i]);
        }
    }
    //求出当前队列的有效个数
    public int size(){
        return (rear+maxSize-front)%maxSize;
    }

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

        return arr[front];
    }
}

 一只Java程序猿

 欢迎点赞关注哦