public class ArrayQueueDemon { public static void main(String[] args) { ArrayQueue Queue = 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(exit):退出程序"); System.out.println("a(add):添加数据到队列"); System.out.println("g(get):从队列取出数据"); System.out.println("h(head):查看队列头的数据"); key = scanner.next().charAt(0); switch (key){ case 's': Queue.showQueue(); break; case 'a': System.out.println("输出一个数"); int value = scanner.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.getQueue(); System.out.printf("队列头的数据是%d\n",res); }catch (Exception e){ System.out.println(e.getMessage()); } break; case 'e': scanner.close(); loop = false; 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; arr = new int[maxSize]; 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 headQueue(){ if (isEmpty()){ throw new RuntimeException("队列是空,没有数据"); } return arr[front+1]; } }
09-15