测试代码插入

package com.dashu;

import java.util.ArrayList;
import java.util.Comparator;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Random;

public class DaShu {


    static Comparator<Integer> cmp = new Comparator<Integer>() {
      public int compare(Integer e1, Integer e2) {
        return e2 - e1;
      }
    };
    static Queue<Integer> sortQueue = new PriorityQueue<Integer>(10,cmp);

    public static void main(String[] args) throws Exception {
        while(true){
            Thread.sleep(1000);
            sortQueue.add(random());
            if(sortQueue.size() == 10){
                List<Integer> list = new ArrayList<Integer>();
                for(int i = 0;i<sortQueue.size();i++){
                    if(i == 0){
                        System.out.println("Max :"+sortQueue.poll());
                    }
                    list.add(sortQueue.poll());
                }
                sortQueue.addAll(list);
                System.out.println("Min: "+list.get(list.size() - 1));
                System.out.println("------------------------------------");
            }
        }
    }

    public static int random(){
        int max=10000;
        int min=1;
        Random random = new Random();
        return random.nextInt(max)%(max-min+1) + min;
    }
}