1.队列
队列是一种线性表,它在队列尾部插入元素,在队列头删除元素。
2.设计
采用静态数组的方式实现队列,并且测试使用,所以只支持int类型,感兴趣的朋友可以自己制作泛型队列。其中设计指向头的元素:front,指向最后一个元素的下一个:rear,队列的空间:maxSize,队列的数据:data[]。
- front 指向队列的头元素,从0开始
- rear 指向队列尾元素的下一个元素 从0开始 当front == rear时,队列为空
- maxSize 队列长度,表示最大值
- data[] 存储队列中的数据
3.代码
public class QueueByArray {
/**
* 根据数组为底层实现队列
*/
private int maxSize; // 队列最大值
private int front; // 指向队列头
private int rear; // 指向队列尾元素的下一位
private int[] data; // 存放队列数据
public static void main(String[] args) {
QueueByArray queueByArray = new QueueByArray(5);
queueByArray.add(1);
queueByArray.add(2);
queueByArray.add(3);
queueByArray.add(4);
queueByArray.add(5);
int[] arr = queueByArray.toArray();
for (int i = 0 ; i < arr.length ; i++){
System.out.println(arr[i]);
}
System.out.println(queueByArray.get());
System.out.println(queueByArray.get());
int[] arr1 = queueByArray.toArray();
for (int i = 0 ; i < arr1.length ; i++){
System.out.println(arr1[i]);
}
}
public QueueByArray(int maxSize){
this.maxSize = maxSize + 1;
data = new int[maxSize];
front = 0;
rear = 0;
}
public QueueByArray(){
maxSize = 50;
front = 0;
rear = 0;
data = new int[maxSize];
}
public boolean isEmpty(){
return front == rear;
}
public boolean isFull(){
return (rear + 1) % maxSize == front;
}
public void add(int arg){
if(isFull()){
throw new RuntimeException("队列已满,无法添加");
}
data[rear] = arg;
rear = (rear + 1) % maxSize;
}
public int get(){
if (isEmpty()){
throw new RuntimeException("队列为空");
}
int temp = data[front];
front = (front + 1) % maxSize;
return temp;
}
public int size(){
return (rear + maxSize - front) % maxSize;
}
public int[] toArray(){
if (isEmpty()){
throw new RuntimeException("队列为空");
}
int[] res = new int[size()];
for (int i = front,j = 0; i < (front + size()); i++){
res[j] = data[i % maxSize];
j ++;
}
return res;
}
}