數據結構之隊列的基本操作(Java基礎)

/*
 * 隊列
 */
public class MyCycleQueue {
	//底層使用數組
	private long[] arr;
	//有效數據的大小
	private int elements;
	//隊頭
	private int front;
	//隊尾
	private int end;
	
	/**
	 * 默認構造方法
	 */
	public MyCycleQueue() {
		arr = new long[10];
		elements = 0;
		front = 0;
		end = -1;
	}
	
	/**
	 * 帶參數的構造方法，參數爲數組的大小
	 */
	public MyCycleQueue(int maxsize) {
		arr = new long[maxsize];
		elements = 0;
		front = 0;
		end = -1;
	}
	
	/**
	 * 添加數據,從隊尾插入
	 */
	public void insert(long value) {
		if(end == arr.length - 1) {
			end = -1;
		}
		arr[++end] = value;
		elements++;
	}
	
	/**
	 * 刪除數據，從隊頭刪除
	 */
	public long remove() {
		long value = arr[front++];
		if(front == arr.length) {
			front = 0;
		}
		elements--;
		return value;
	}
	
	/**
	 * 查看數據，從隊頭查看
	 */
	public long peek() {
		return arr[front];
	}
	
	/**
	 * 判斷是否爲空
	 */
	public boolean isEmpty() {
		return elements == 0;
	}
	
	/**
	 * 判斷是否滿了
	 */
	public boolean isFull() {
		return elements == arr.length;
	}
}