好像是写了一个很简单的排序

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;

public class Z3 {

/**
 * @param args
 */
@SuppressWarnings("unchecked")
public static void main(String[] args) {
	// TODO Auto-generated method stub
	System.out.println("请输入一批整数，输入非数字结束");

	Scanner scan = new Scanner(System.in);

	ArrayList a = new ArrayList();
	while (scan.hasNextInt()) {
		a.add(scan.nextInt());

	}

	int len = a.size();

	int max = (Integer) a.get(0);

	int swap;
	for (int i = 0; i < len; i++)

	{
		max = (Integer) a.get(i);

		for (int j = i; j < len; j++) {

			if ((Integer) a.get(j) > max) {
				max = (Integer) a.get(j);

				swap = (Integer) a.get(i);

				a.set(i, a.get(j));
				a.set(j, swap);

			}

		}

	}

	System.out.println(a);

	System.out.println("最大值：" + a.get(0));
	System.out.println("最小值：" + a.get(len - 1));

}

}