题解 | #对整型数组按照升序或降序进行排序#
输入整型数组和排序标识,对其元素按照升序或降序进行排序
https://www.nowcoder.com/practice/dd0c6b26c9e541f5b935047ff4156309
import java.util.Arrays; import java.util.List; import java.util.Scanner; import java.util.TreeSet; import java.util.stream.Collectors; // 注意类名必须为 Main, 不要有任何 package xxx 信息 public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int totalNum = sc.nextInt(); int[] source = new int[totalNum]; for (int i = 0; i < totalNum; i++) { source[i] = sc.nextInt(); } boolean orderFlag = 0 == sc.nextInt(); TreeSet<Integer> integers = new TreeSet<>((pre, current) -> { int diff = pre - current; diff = orderFlag ? diff : -diff; return diff == 0 ? 1 : diff; }); for (int i : source) { integers.add(i); } StringBuilder result = new StringBuilder(); for (Integer integer : integers) { result.append(" ").append(integer); } System.out.println(result.delete(0, 1)); } }