public class Demo01 {
public static void main(String[] args) {
ArrayList list = new ArrayList();
Scanner sc = new Scanner(System.in);
int score=0;
for (int i=0;i<10;i++){
System.out.println("请输入第" + (i + 1) + "个同学的成绩");
score=sc.nextInt();
list.add(score);
}
System.out.println("没有排序之前");
System.out.print("\t"+list);
System.out.println();
Collections.sort(list);
System.out.println("排序之后");
System.out.println("\t"+list);
}
}
Collections.sort(list, new Comparator<Integer>() {
@Override
public int compare(Integer o1, Integer o2) {
return o2 - o1;
}
});
记得ArrayList用泛型
我帮你把代码整理了一下,你参考看看吧:
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;
public class Demo01 {
public static void main(String[] args) {
List<Integer> list = new ArrayList<Integer>();
Scanner sc = new Scanner(System.in);
int score = 0;
for (int i = 0; i < 10; i++) {
System.out.println("请输入第" + (i + 1) + "个同学的成绩");
score = sc.nextInt();
list.add(score);
}
System.out.println("没有排序之前");
System.out.print("\t" + list);
System.out.println();
Collections.sort(list);
System.out.println("排序之后");
System.out.println("\t" + list);
Collections.reverse(list);
System.out.println("反转排序之后");
System.out.println("\t" + list);
}
}
如有帮助,请采纳
list.sort(Comparator.reverseOrder());