算法第四版1.3背包、队列和栈：习题1.3.36

import edu.princeton.cs.algs4.StdRandom;
import edu.princeton.cs.algs4.StdOut;

import java.util.Iterator;

public class RandomQueue<Item>implements Iterable<Item> {
    public static void main(String[]args){
        RandomQueue<Integer> 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<arr.length/4)
            resizeArray(arr.length/2);
        int index= StdRandom.uniform(0,N);
        Item temp=arr[index];
        arr[index]=arr[N-1];
        arr[N-1]=temp;
        return arr[--N];
    }
    public Item sample(){
        return arr[StdRandom.uniform(0,N)];
    }
    private void resizeArray(int max){
        Item[] newarr=(Item[]) new Object[max];
        for (int i=0;i<N;i++)
            newarr[i]=arr[i];
        arr=newarr;
    }
    public Iterator<Item> iterator(){
        return new RandomQueueIterator();
    }
    private  class RandomQueueIterator implements Iterator<Item>{
        private Item[] newarr=(Item[])new Object[N];
        private int index;
        public RandomQueueIterator(){
            for (int i=0;i<N;i++)
                newarr[i]=arr[i];
            StdRandom.shuffle(newarr);
            index=0;
        }
        public boolean hasNext(){return index!=N;}
        public Item next(){return newarr[index++] ;}
    }
}