Java数组模拟循环队列 -- 数据结构的学习

循环队列

package algorithm.queue;

import java.util.Scanner;

/**
 * 环形队列
 * 注意思路：取模运算
 * @author lenovo
 *
 */
public class CircleArrayQueueDemo {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		System.out.println("测试队列");
		CircleArrayQueue queue = new CircleArrayQueue(3);
		Scanner sc = new Scanner(System.in);
		//演示队列效果
		while(true) {
			System.out.println("s(show): 显示所有队列数据");
			System.out.println("a(add): 添加到队列数据");
			System.out.println("g(get): 从队列中取数据");
			System.out.println("h(head): 显示队列头个数据");
			System.out.println("e(exit): 退出");
			String next = sc.next();
			switch(next) {
			case "s":
				queue.show();
				System.out.println();
				break;
			case "a":
				System.out.println("输入添加的数据");
				int elem = sc.nextInt();
				try {
					queue.addElem(elem);
				} catch (Exception e1) {
					System.out.println("操作失败，原因："+e1.getMessage());
					break;
				}
				System.out.println("操作成功");
				break;
			case "g":
				try {
					System.out.println("取出数据为："+queue.getElem());
				}catch(Exception e) {
					System.out.println("操作失败，原因："+e.getMessage());
				}
				break;
				
			case "h":
				try {
					System.out.println("队列中头数据为："+queue.showHead());
				}catch(Exception e) {
					System.out.println(e.getMessage());
				}
				break;
			case "e":
				sc.close();
				System.out.println("bye-bye");
				return;
			default:
				System.out.println("输入错误！");
			}
		}
	}

}

class CircleArrayQueue{
	private int front;//指向第一个元素  初始值0    涉及取元素 
	private int rear;//指向最后一个元素的后一个位置  初始值0  涉及加元素   预留一个空位置
	private int[] arr;
	private int maxSize;//数组的最大容量
	
	//构造
	public CircleArrayQueue(int maxSize) {
		this.maxSize = maxSize;
		arr = new int[maxSize];
	}
	
	//队是否满
	public boolean isFull() {
		//循环队列判满条件：(rear + 1)%maxSize == front
		//由于队列循环，rear要与front比较，而不是maxsize
		return (rear + 1) % maxSize == front;
		
	}
	//队是否空
	public boolean isEmpty() {
		//循环队列判空条件  rear指向空元素  front追上rear表明队列为空
		return front == rear;
	}

	//显示头元素
	public int showHead() {//peek
		if (isEmpty()) {
			throw new RuntimeException("空");
		}
		int val = arr[front];
		return val;
	}
	//取元素
	public int getElem() {
		if (isEmpty()) {
			throw new RuntimeException("空");
		}
//		front指向第一个元素位置，直接取就ok
		int val = arr[front];
//		front++;
		//小算法，用取模的方式代替判断是否到达maxsize
		front = (front + 1) % maxSize;
		return val;
	}
	//添加元素
	public void addElem(int elem) {
		if (isFull()) {
			throw new RuntimeException("满");
		}
		//rear指向空元素位置，直接添值就ok
		arr[rear] = elem;
		//小算法，用取模的方式代替判断是否到达maxsize
		rear = (rear + 1) % maxSize ;
	}
	//显示元素
	public void show() {
		if (isEmpty()) {
			System.out.println("空");
			return;
		}
		//*****************思考部分********************
		//遍历从front开始的有效元素  front + (rear - front + maxsize) % maxsize
		for (int i = front; i <front + size(); i++) {
			System.out.printf("arr[%d] = %d\t",i%maxSize,arr[i%maxSize]);
		}
		
	}
	//有效元素
	public int size() {
		return (rear - front + maxSize) % maxSize;
	}

}