Java程序以相反的顺序对整数列表进行排序
以下是我们的整数数组:
Integer[] arr = {20, 50, 100, 150, 200, 250, 300, 350, 400, 500};
现在将上面的Integer数组转换为List:
List<Integer> list = new ArrayList<>(Arrays.asList(arr));
现在,以相反的顺序对上述Integer列表进行排序:
Comparator<Integer> initialComp = Integer::compare; Comparator<Integer> revComp = initialComp.reversed(); Collections.sort(list, revComp);
以下是对Integer列表进行反向排序的示例:
示例
import java.util.ArrayList; import java.util.Arrays; import java.util.Collections; import java.util.Comparator; import java.util.List; public class Demo { public static void main(String[] args) { Integer[] arr = {20, 50, 100, 150, 200, 250, 300, 350, 400, 500}; List<Integer> list = new ArrayList<>(Arrays.asList(arr)); System.out.println("Integer List = "+list); Comparator<Integer> initialComp = Integer::compare; Comparator<Integer> revComp = initialComp.reversed(); Collections.sort(list, revComp); System.out.println("Integer in reversed order..."); list .stream() .forEach(c -> System.out.print(c + "\n")); } }
输出结果
Integer List = [20, 50, 100, 150, 200, 250, 300, 350, 400, 500] Integer in reversed order... 500 400 350 300 250 200 150 100 50 20