队列

核心：先进先出

实现队列：

package ch04;

public class Queue {
	// 数组
	private long[] arr;

	// 最大空间
	private int maxSize;

	// 有效元素大小
	private int elmes;

	// 对头
	private int font;

	// 队尾
	private int end;

	// 构造方法
	public Queue(int maxSize) {
		this.maxSize = maxSize;
		arr = new long[maxSize];
		elmes = 0;
		font = 0;
		end = -1;
	}

	// 插入数据
	public void insert(long value) {
		arr[++end] = value;
		elmes++;
	}

	// 移除数据
	public long remove() {
		elmes--;
		return (arr[font++]);
	}

	// 是否为空
	public boolean isEmpty() {
		return (elmes == 0);
	}

	// 是否满了
	public boolean isFull() {
		return (end == maxSize - 1);
	}

	// 返回有效元素大小
	public int size() {
		return maxSize;

	}

	public static void main(String[] args) {
		Queue queue = new Queue(5);
		System.out.println(queue.isEmpty());

		queue.insert(50);
		queue.insert(10);
		queue.insert(40);
		queue.insert(30);
		queue.insert(20);

		System.out.println(queue.isEmpty());
		System.out.println(queue.isFull());

		while (!queue.isEmpty()) {
			System.out.print(queue.remove() + " ");
		}
		System.out.println();
		System.out.println(queue.size());
	}

}