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

把 10 秒内生成的数弄成一个数组，然后 Arrays.sorft(数组)，最小取数组第 0，最大取数组最后一个。

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

}

"

调用及测试类
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;
}

}

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 奖励坐着到账