アルゴリズムの第4版の1.3リュックサック、行列と倉庫:練習問題の1.3.36
1483 ワード
import edu.princeton.cs.algs4.StdRandom;
import edu.princeton.cs.algs4.StdOut;
import java.util.Iterator;
public class RandomQueue- implements Iterable
- {
public static void main(String[]args){
RandomQueue
queue=new RandomQueue<>(10);
for (int i=1;i<14;i++)
queue.enqueue(i);
for (int i:queue)
StdOut.print(i+" ");
StdOut.println();
}
private Item[] arr;
private int N;
public RandomQueue(int caps){
arr=(Item[]) new Object[caps];
N=0;
}
public boolean isEmpty(){return N==0;}
public int size(){return N;}
public void enqueue(Item item){
if (arr.length==N)
resizeArray(arr.length*2);
arr[N++]=item;
}
public Item dequeue(){
if (N iterator(){
return new RandomQueueIterator();
}
private class RandomQueueIterator implements Iterator- {
private Item[] newarr=(Item[])new Object[N];
private int index;
public RandomQueueIterator(){
for (int i=0;i