import java.util.Arrays;
import java.util.stream.Collectors;

public class CircleQueue {

  /**
   * 數(shù)組長(zhǎng)度
   */
  private int maxSize;

  /**
   * 隊(duì)頭指針
   */
  private int front;

  /**
   * 隊(duì)尾指針
   */
  private int rear;

  private String[] queue;

  /**
   * 初始化循環(huán)隊(duì)列
   * @param objSize 元素個(gè)數(shù)
   */
  public CircleQueue(int objSize) {
    // 循環(huán)隊(duì)列為了區(qū)分空隊(duì)列和滿隊(duì)列，所以多預(yù)留一個(gè)空元素空間，這里的maxSize比元素個(gè)數(shù)多1
    this.maxSize = objSize + 1;
    this.front = 0;
    this.rear = 0;
    this.queue = new String[this.maxSize];
  }

  /**
   * 隊(duì)列是否空
   * @return
   */
  public boolean isEmpty() {
    return front == rear;
  }

  /**
   * 隊(duì)列是否滿
   * @return
   */
  public boolean isFull() {
    return front == (rear+1) % maxSize;
  }

  /**
   * 入隊(duì)
   * @param a 入隊(duì)元素
   */
  public void add(String a) {
    if (isFull()) {
      System.out.println("隊(duì)列滿");
      return;
    }
    queue[rear%maxSize] = a;
    rear = (rear+1)%maxSize;
  }

  /**
   * 出隊(duì)
   * @return 出隊(duì)元素
   */
  public String remove() {
    if (isEmpty()) {
      System.out.println("隊(duì)列空");
      return null;
    }
    String a = queue[front%maxSize];
    queue[front%maxSize] = null;
    front = (front+1)%maxSize;
    return a;
  }

  public static void main(String[] args) {
    // 模擬一個(gè)4個(gè)元素大小隊(duì)列的入隊(duì)出隊(duì)情況
    // a,b,c入隊(duì)；【正常，元素a,b,c，frnotallow=0，rear=3】
    // a出隊(duì)；【正常，元素b,c，frnotallow=1，rear=3】
    // d,e入隊(duì)；【正常，元素b,c,d,e frnotallow=1，rear=0】// 循環(huán)隊(duì)列
    // f入隊(duì)；【異常，隊(duì)列滿】
    // b,c,d,e出隊(duì)【正常，隊(duì)列空 frnotallow=0，rear=0】

    CircleQueue circleQueue = new CircleQueue(4);

    System.out.print("a,b,c入隊(duì):");
    circleQueue.add("a");
    circleQueue.add("b");
    circleQueue.add("c");
    System.out.println(Arrays.stream(circleQueue.queue).collect(Collectors.toList()) + "frnotallow=" + circleQueue.front + "；rear" + circleQueue.rear);

    System.out.print("a出隊(duì):");
    String remove1 = circleQueue.remove();
    System.out.println(remove1 + "；" + Arrays.stream(circleQueue.queue).collect(Collectors.toList()) + "frnotallow=" + circleQueue.front + "；rear" + circleQueue.rear);

    System.out.print("d,e入隊(duì):");
    circleQueue.add("d");
    circleQueue.add("e");
    System.out.println(Arrays.stream(circleQueue.queue).collect(Collectors.toList()) + "frnotallow=" + circleQueue.front + "；rear" + circleQueue.rear);

    System.out.print("f入隊(duì):");
    circleQueue.add("f");
    System.out.println(Arrays.stream(circleQueue.queue).collect(Collectors.toList()) + "frnotallow=" + circleQueue.front + "；rear" + circleQueue.rear);

    System.out.print("b,c,d,e出隊(duì):");
    String remove2 = circleQueue.remove();
    String remove3 = circleQueue.remove();
    String remove4 = circleQueue.remove();
    String remove5 = circleQueue.remove();
    System.out.println(remove2+","+remove3+","+remove4+","+remove5+","+"；" + Arrays.stream(circleQueue.queue).collect(Collectors.toList()) + "frnotallow=" + circleQueue.front + "rear" + circleQueue.rear);
  }
}

package cn.gov.zcy.announcement;

import java.util.Arrays;
import java.util.stream.Collectors;

public class Stack {

  // 數(shù)組長(zhǎng)度
  private int maxSize;

  /**
   * 棧頂指針
   */
  private int top;

  private String[] stack;

  /**
   * 初始化棧
   * @param objSize 元素個(gè)數(shù)
   */
  public Stack(int objSize) {
    maxSize = objSize;
    top = -1;
    stack = new String[maxSize];
  }

  /**
   * 判斷棧是否空
   * @return
   */
  public boolean isEmpty() {
    return top == -1;
  }

  /**
   * 判斷棧是否滿
   * @return
   */
  public boolean isFull() {
    return top == maxSize-1;
  }

  /**
   * 入棧
   * @param a 入棧元素
   */
  public void push(String a) {
    if (isFull()) {
      System.out.println("棧滿");
      return;
    }
    top = top + 1;
    stack[top] = a;
  }

  /**
   * 出棧
   * @return 出棧元素
   */
  public String pop() {
    if (isEmpty()) {
      System.out.println("棧空");
      return null;
    }
    String a = stack[top];
    top = top - 1;
    return a;
  }

  public static void main(String[] args) {
    // 模擬一個(gè)4個(gè)元素大小棧的入棧和出棧的情況
    // a,b,c,d入棧【正常，元素a,b,c,d，top=3】
    // e入棧【異常，棧滿】
    // d,c,b,a出棧【正常，出棧順序d,c,b,a，top=-1】
    // 出棧【異常，棧空】
    Stack test = new Stack(4);

    System.out.print("a,b,c,d入棧：");
    test.push("a");
    test.push("b");
    test.push("c");
    test.push("d");
    System.out.println(Arrays.stream(test.stack).collect(Collectors.toList()) + "；top=" + test.top);

    System.out.print("e入棧：");
    test.push("e");
    System.out.println(Arrays.stream(test.stack).collect(Collectors.toList()) + "；top=" + test.top);

    System.out.print("d,c,b,a出棧：");
    String pop1 = test.pop();
    String pop2 = test.pop();
    String pop3 = test.pop();
    String pop4 = test.pop();
    System.out.println(pop1 + "," + pop2 + "," + pop3 + "," + pop4 + "," + "；top=" + test.top);

    System.out.print("空棧出棧：");
    String pop5 = test.pop();
    System.out.println(pop5 + "；top=" + test.top);
}

}