1 package com.aixuexi.contact;  2   3 public class CirArrQunue {  4     public static void main(String[] args) {  5         /*  6          * 2019/7/15 15点58分  7          * 2个问题   几个算法公式  8          *   9          *  10          *     (rear + 1) % maxSize == front 判断队列是否满 11          *     rear = 4      屁股 12          *     front = 0     头 13          *     maxSize = 5    最大数 14          *  (4 + 1) % 5 = 0 15          *  16          *  17          *  rear == front 18          *     默认 都为0 19          *  20          *  21          *     (rear + 1) % maxSize 22          *     添加元素 尾指针+1 23          *     默认  rear = 0  24          *     maxSize = 5    最大数 25          *     rear = (rear + 1) % 5 26          *  27          *  28          *     (front + 1) % maxSize 29          *     front = (front + 1) % maxSize; //将 front 后移, 考虑取模 30          *     默认front = 0     头 31          *     front = (0 + 1) % 5         front == 1 32          *  33          *  34          *     (rear + maxSize - front) % maxSize    算个数 35          *     rear = 3 36          *     maxSize = 5 37          *     front  = 0 没弹出数据 38          *     value = （3 + 5 - 0）%5   valiue == 3 39          *  40          *  41          *     显示队列 42          *     for(int i = front; i