队列一（单向队列的实现）

/**
 * 单向队列
 * @author huyua
 *
 */
public class Queue {
	
	//队列大小
	private int maxSize;
	//队列数组
	private int arr[];
	//队头
	private int font;
	//队尾
	private int end;
	//有效长度
	private int elem;
	
	public Queue(int size) {
		this.maxSize = size;
		this.arr = new int[maxSize];
		this.elem = 0;
		this.font = 0;
		this.end = -1;
	}
	//插入
	public void insert(int value) {
		elem++;
		arr[++end]=value;
	}
	//取出
	public int remove() {
		elem--;
		return arr[font++];
	}
	//是否为空
	public boolean  isEmpty() {
		return (elem == 0);
	}
	//队列是否满了
	public boolean isFull() {
		return (elem == maxSize);
	}
}