java数据结构----循环队列的实现
代码实现:
public class CycleQueue {
private int[] array;
private int elements;
private int front;
private int end;
public CycleQueue()
{
array=new int[10];
elements=0;
front=0;
end=-1;
}
public CycleQueue(int maxsize)
{
array=new int[maxsize];
elements=0;
front=0;
end=-1;
}
/**
* 添加数据
*/
public void insert(int value)
{
if(end==array.length-1)
{
end=-1;
}
array[++end]=value;
elements++;
}
/**
* 删除数据
*/
public int remove()
{
int value=array[front++];
if(front==array.length)
{
front=0;
}
elements--;
return array[front++];
}
/**
* 查看数据
*/
public int peek()
{
return array[front];
}
/**
* 判断是否为空
*/
public boolean isEmpty()
{
return elements==0;
}
/**
* 判断是否为满
*/
public boolean isFull()
{
return elements==array.length;
}
}