java实现数据结构-队列

package d0723ArrayQueue;

import java.util.Scanner;

public class Demo {
    public static void main(String[] args) {
        ArrayQueue queue = new ArrayQueue(3);
        char key=' ';
        Scanner sc = new Scanner(System.in);
        boolean loop=true;
        while (loop){
            System.out.println("s(show):显示队列");
            System.out.println("e(exit):退出");
            System.out.println("a(add):添加数据到队列");
            System.out.println("g(get):取出数据");
            System.out.println("h(head):查看队列头的数据");
            key=sc.next().charAt(0);//接受一个字符
            switch (key){
                case 's':
                    queue.showQueue();
                    break;
                case 'a':
                    System.out.println("输入一个数据");
                    int value=sc.nextInt();
                    queue.addQueue(value);
                    break;
                case 'g':
                    try {
                        int res = queue.getQueue();
                        System.out.printf("取出的数据是%d\n",res);

                    }catch (Exception e){
                        System.out.println(e.getMessage());
                    }
                    break;
                case 'h':
                    try{
                        int res=queue.showFront();
                        System.out.printf("队列头的数据是%d\n",res);
                    }catch (Exception e){
                        System.out.println(e.getMessage());
                    }
            }
        }
    }
     static class ArrayQueue{
        private int maxSize;//数组最大容量
        private int front;//队列头
        private int rear;//队列尾
        private int[] arr;
        //创建队列的构造器
        public ArrayQueue(int arrMaxSize){
            maxSize=arrMaxSize;
            arr=new int[arrMaxSize];
            front =-1;//指向队列头部，分析front 是指向队列头的前一个位置
            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()){
                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 showFront(){
            if (isEmpty()){
                throw new RuntimeException("队列为空");
            }
            return arr[front+1];
        }

    }
}