算法练习：求最大值和最小值

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;
    }
}

代码已完成，没什么算法，就为了打非要算法人的脸。还有我的 500 奖励坐着到账

😄 好了，这一次算法练习，最佳答案是 @x4storm 童鞋提交的 JS 代码。

另外还有两名童鞋也提交了代码，可惜没有实现功能。但是重在参与，也是会有奖励的。

奖励列表：

@x4storm ＋300 分

@flhuoshan ＋100 分

@tomaer ＋100 分

js 版本奉上

var Data = {
        init: function() {
            this.interval(1000);
        },
        pool: [],
        maxCount: 10000,
        generate: function() {
            var num = Math.ceil(Math.random() * 10000);
            this.pool.push(num);
            if (this.pool.length > this.maxCount) {
                this.pool.splice(0, this.pool.length - 10);
            }
        },
        interval: function(interTime) {
            var self = this;
            setInterval(function() {
                self.generate();
            }, interTime);
        }
    }

    function getNum(count, Data) {
        var sets = Data.slice(Data.length - count, Data.length);
        console.log(sets);
        console.log("Max is : ", Math.max.apply(null, sets));
        console.log("Min is : ", Math.min.apply(null, sets));
    }

    Data.init();

    getNum(10, Data.pool);

😄

var code="
import java.util.ArrayList;

import java.util.List;

public class ArrayQueue implements Queue {
List data;
int capacity;

public ArrayQueue(int capacity) {
	data = new ArrayList<T>();
	this.capacity = capacity;

}

public void push(T t) {

	if (this.capacity == data.size()) {
		data.remove(0);
	}
	data.add(t);
}

public T poll() {
	T t = data.remove(0);
	return t;
}

public int size() {
	return data.size();
}

public T peak() {
	return data.get(data.size() - 1);
}

public boolean isEmpty() {
	return 0 == data.size();
}

public boolean isFull() {
	return capacity == data.size();
}

public static void main(String[] args) {

	ArrayQueue<Integer> queue = new ArrayQueue<Integer>(10);

	for (int i = 0; i < 10; i++) {
		queue.push(i);
	}
	System.out.println(queue.capacity);
	System.out.println(queue.peak());
	System.out.println(queue.poll());
	queue.push(new Integer(11));

	System.out.println(queue.data);
}

}

"