java初学者--构造队列

public class queue {
	long arr[];
	static int sum;
	int front;
	int end;
	public queue() {
		super();
		arr=new long[10];
		sum=0;
		front=-1;
		end=-1;
	}
	public queue(int length) {
		super();
		arr=new long[length];
		sum=0;
		front=-1;
		end=-1;
	}
	void add(int v) {
		if(end==arr.length-1) {
			end=-1;
		}
		arr[++end]=v;
		sum++;
	}
	long remove() {
		if(front==arr.length-1) {
			front=-1;
		}
		sum--;
		return arr[++front];
	}
	long see() {
		return arr[front];
	}
	boolean empty()
	{
		if(sum==0) {
			return true;
		}
		return false;
	}
	boolean full()
	{
		if(sum==arr.length) {
			return true;
		}
		return false;
	}
	public static void main(String[] args) {
		queue a=new queue(4);
		System.out.println(a.empty());
		a.add(1);
		a.add(2);
		a.add(3);
		a.add(4);
		System.out.println(a.full());
		while(a.empty()!=true) {
			System.out.println(a.remove());
		}
	}
}

下图为运行结果：