数据结构顺序队列和循环队列基础 java数据结构基础:顺序队列和循环队列

//顺序队列
public class ArrayQueue {
	private int maxSize;    //数组的最大容量
	private int front;        //队头指针
	private int rear;        //队尾指针
	private int[] array;    //存放数据
	public ArrayQueue(int arrMaxSize) {
		maxSize = arrMaxSize;
		array = 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++;    //rear后移
		array[rear] = n;
	}
	//出队
	public int getQueue() {
		//判断队列是否空
		if (isEmpty()) {
			throw new RuntimeException("队列为空");
		}
		front++;    //front后移
		return array[front];
	}
	//取队头数据
	public int headQueue() {
		if (isEmpty()) {
			throw new RuntimeException("队列为空");
		}
		return array[front + 1];
	}
	//输出队列所有数据
	public void showQueue() {
		//遍历输出
		if (isEmpty()) {
			System.out.println("队列为空");
            return;
		}
		for (int i = 0; i < array.length; i++) {
			System.out.printf("array[%d] = %d\n", i, array[i]);
		}
	}
}

//循环队列
public class CircleQueue {
	private int maxSize;    //数组的最大容量
	private int front;        //队头指针
	private int rear;        //队尾指针
	private int[] array;    //存放数据
	public CircleQueue(int arrMaxSize) {
		maxSize = arrMaxSize;
		array = 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;
		}
		array[rear] = n;
		rear = (rear + 1) % maxSize;
	}
	//出队
	public int getQueue() {
		//判断队列是否空
		if (isEmpty()) {
			throw new RuntimeException("队列为空");
		}
		//保存front对应的值
		int value = array[front];
		front = (front + 1) % maxSize;
		return value;
	}
	//取队头数据
	public int headQueue() {
		if (isEmpty()) {
			throw new RuntimeException("队列为空");
		}
		return array[front];
	}
	//获取当前队列有效数据个数
	public int size() {
		return (rear + maxSize - front) % maxSize;
	}
	//输出队列所有数据
	public void showQueue() {
		//遍历输出
		if (isEmpty()) {
			System.out.println("队列为空");
            return;
		}
		//从front开始遍历
		for (int i = front; i < front + size(); i++) {
			System.out.printf("array[%d] = %d\n", i % maxSize, array[i % maxSize]);
		}
	}
}