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

@DASHU 多少？

情景看来不需要算法，如果真需要算法的话，给你一个递推方程：
f(n-10,n)=Max[f(n-10,n-1)+num[n],f(n-10,n-1)] (n>=10)

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.List;

public class Operation {

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(10));
	queue.push(new Integer(11));		
	queue.push(new Integer(12));	
	queue.push(new Integer(13));	
	queue.push(new Integer(14));	
	queue.push(new Integer(15));	
	System.out.println(queue.data);
	System.out.println("最大值："+Operation.max(queue.data));
	System.out.println("最小值："+Operation.min(queue.data));


}

public static int max(List<Integer> list){
	int max = list.get(0);
	for(Integer cur: list){
		max = max <cur? cur:max;
	}
	return max;
}

public static int min(List<Integer> list){
	
	int min = list.get(0);
	for(Integer cur: list){
		min = min >cur? cur:min;
	}
	return min;
}

}