/**
*顺序队列
* @param 泛型T
*/
public class SequenceQueue {
private T[] data;
private int front;//头指针
private int rear;//尾指针
//capacity 容量大小
public SequenceQueue(int capacity) {
data = (T[]) new Object[capacity];
front = 0;// 队头指针,指向实际队头元素
rear = 0;// 队尾指针,指向实际队尾元素的下一个位置
}
public boolean isEmpty() {
if (front == rear) {
return true;
} else {
return false;
}
}
public boolean isFull() {
if (rear - front >= data.length || rear >= data.length) {
return true;
} else {
return false;
}
}
public void insert(T t) throws Exception {
if (isFull()) {
throw new Exception("push into full queue exception");
}
data[rear] = t;
rear++;
}
public void remove() throws Exception {
if (isEmpty()) {
throw new Exception("remove from empty queue exception");
}
front++;
}
/**
* 取得队头元素
*
* @return
* @throws Exception
*/
public T getFront() throws Exception {
if (isEmpty()) {
throw new Exception("remove from empty queue exception");
}
return data[front];
}
public void show() {
System.out.print("front:" + front + ",rear:" + rear+",[");
for (int i = front; i
System.out.print(data[i]);
if (i!=rear-1) {
System.out.print(",");
}
}
System.out.println("]");
}
public static void main(String[] args) throws Exception {
SequenceQueue queue = new SequenceQueue<>(10);
queue.show();
queue.insert(1);
queue.show();
queue.insert(2);
queue.show();
queue.insert(3);
queue.show();
queue.insert(4);
queue.show();
queue.insert(5);
queue.show();
queue.insert(6);
queue.show();
queue.insert(7);
queue.show();
queue.insert(8);
queue.show();
queue.insert(9);
queue.show();
queue.insert(10);
queue.show();
queue.remove();
queue.show();
queue.remove();
queue.show();
queue.remove();
queue.show();
queue.remove();
queue.show();
queue.remove();
queue.show();
queue.remove();
queue.show();
queue.remove();
queue.show();
queue.remove();
queue.show();
queue.remove();
queue.show();
queue.remove();
queue.show();
}
}