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

数组模拟队列

package algorithm.queue;

import java.util.Scanner;

/**
 *    数组模拟队列
 *    缺点：不能复用，数组用一次作废
 *    解决：环形队列
 * @author lenovo
 *
 */
public class ArrayQueueDemo {
	
	public static void main(String[] args) {
		System.out.println("测试队列");
		ArrayQueue queue = new ArrayQueue(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 ArrayQueue{
	private int front;//指向第一个元素的前一个位置 初始值-1
	private int rear;//指向最后一个元素 初始值-1
	private int[] arr;
	private int maxSize;//数组的最大容量
	
	//构造器
	public ArrayQueue(int maxSize) {
		this.maxSize = maxSize;
		arr = new int[maxSize];
		front = -1;
		rear = -1;
	}
	
	//队是否满
	public boolean isFull() {
		return rear == maxSize-1;
		
	}
	//队是否空
	public boolean isEmpty() {
		return front == rear;
	}
	
	//存数据
	public void addElem(int elem) {
		if (isFull()) {
			//System.out.println("队列满");//返回值是void，不需要抛异常，但最好用异常信息，上一层捕捉信息
			throw new RuntimeException("队列满");
		}
		rear++;
		arr[rear] = elem;
	}
	
	//取数据
	public int getElem() {
		if (isEmpty()) {
			throw new RuntimeException("队列空");//抛出异常，自带return效果。这里涉及返回值所以抛异常
		}
		front++;
		return arr[front];
	}

	//查看所有数据
	public void show() {
		if (isEmpty()) {
			System.out.println("队列空");
			return;
		}
		for (int i =0; i <arr.length; i++) {
			System.out.printf("arr[%d] = %d\t",i,arr[i]);
		}
	}
	
	//查看头元素
	public int showHead() {
		if (isEmpty()) {
			throw new RuntimeException("队列空");
		}
		int value = arr[++front];//取出头元素
		front--;//队头指针还原，视频中此处是坑点
		return value;
	}
	
	
	
	
	
}