—————————————————
Queue
—————————————————
-element: int[]
-size: int
—————————————————
+Queue()
+euqueue(v: int): void
+dequeue(): int
+empty(): boolean
+getSize(): int
—————————————————
package pack2;
public class Queue {
private int[] element; //元素数组
private int size; //队列大小
public Queue() {
element = new int[8];
}
/**入队*/
public void enqueue(int v) {
if(size >= element.length) {
int[] temp = new int[size * 2];
System.arraycopy(element, 0, temp, 0, size);
element = temp;
}
element[size++] = v;
}
/**出队*/
public int dequeue() {
if(size <= 0) return Integer.MAX_VALUE;
int temp = element[0];
for (int i = 1; i < element.length; i++)
element[i - 1] = element[i];
size--;
return temp;
}
/**判空*/
public boolean empty() {
return size == 0;
}
/**返回队列大小*/
public int getSize() {
return size;
}
//——————————————————————————————————————————————
public static void main(String[] args) {
Queue queue = new Queue();
for (int i = 0; i <= 20; i++)
queue.enqueue(i);
while(!queue.empty()) {
System.out.print(" " + queue.dequeue());
if(queue.getSize() % 10 == 0)
System.out.println();
}
}
}