数据结构--数据模拟队列(Java)

实现如下：

package com.datastructure;

/**
 * 数组模拟队列
 * @author c
 *
 */
import java.util.Scanner;

public class ArrayQueueTest {

	public static void main(String[] args) {
		
		//2.模拟测试
		ArrayQueue queue = new ArrayQueue(3);
		
		char key = ' ';
		Scanner scanner = new Scanner(System.in);
		
		boolean loop = true;
		while (loop) {
			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)退出程序");
			
			key = scanner.next().charAt(0);
			switch (key) {
			case 's':
				queue.showQueue();
				break;
			case 'a':
				System.out.println("enter a number: ");
				int value = scanner.nextInt();
				queue.addQueue(value);
				break;
			case 'g':
				try {
					int result = queue.getQueue();
					System.out.println("取出的数据为: "+result);
				}catch (Exception e) {
					System.out.println(e.getMessage());
				}
				break;
			case 'h':
				try {
					int result = queue.headQueue();
					System.out.println("队列头数据为: "+result);
				}catch (Exception e) {
					System.out.println(e.getMessage());
				}
				break;
			case 'e':
				scanner.close();
				loop = false;
				break;
			default:
				break;
			}
		}
		
		System.out.println("Exit.");
		
	}

}


class ArrayQueue {
	
	private int[] array;  //队列数组存放数据
	private int maxSize;  //数组大小
	private int front;    //队列头
	private int rear;     //队列尾
	
	
	//1.1队列构造器
	public ArrayQueue(int maxSize) {
		this.maxSize = maxSize;
		array = new int[maxSize];
		front = -1;  //指向队列头的前一个数据
		rear = -1;	 //指向队列尾的最后一个数据
	}
	
	//1.2判断队列是否为满
	public boolean isFull() {
		return rear==maxSize-1;
	}
	
	//1.3判断队列是否为空
	public boolean isEmpty() {
		return front==rear;
	}
	
	//1.4添加数据到队列中
	public void addQueue(int n) {
		if (isFull()) {
			System.out.println("队列已满  无法添加数据.");
			return;
		}
		rear++;  //队列尾后移一位
		array[rear] = n;
	}
	
	
	//1.5从队列中取出数据
	public int getQueue() {
		if (isEmpty()) {
			throw  new RuntimeException("队列为空  无法取出数据.");
		}
		front++;  //队列头后移一位
		return array[front];
	}
	
	//1.6显示队列所有数据
	public void showQueue() {
		if (isEmpty()) {
			System.out.println("没有数据.");
			return;
		}
		for (int i=0; i<array.length; i++) {
			System.out.println("array[" + i + "]=" + array[i]);
		}
	}
	
	//1.7显示队列头数据
	public int headQueue() {
		if (isEmpty()) {
			throw new RuntimeException("没有数据.");
		}
		return array[front+1];
	}
	
}