String[] queue; int front = 0; int rear = 0;
构造方法
public QueueOfStrings(int capacity) {
queue = new String[capacity];
}
进队列
public void enqueue(String str) {
queue[rear++] = str;
if (rear == queue.length)
resize(2 * queue.length);
}
@H_403_0@出队列
public String dequeue() {
return queue[front++];
}
@H_403_0@判空
public boolean isEmpty() {
return front == rear;
}
@H_403_0@判满
public boolean isFull() {
return rear == queue.length;
}
@H_403_0@尺寸
public int size() {
return rear - front;
}
最后附上resize
public void resize(int capacity) {
String[] copy = new String[capacity];
for (int i = 0; i < rear; i++)
copy[i] = queue[i];
queue = copy;
}
