题解 | #输入整型数组和排序标识，按照升序或降序排序#

效率为啥这么低？

package com.example.demo.simple;

import java.util.*;

/**
 * 【输入整型数组和排序标识，对其元素按照升序或降序进行排序】
 *
 */
public class Main_40 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int size = sc.nextInt();

        Integer[] ints = new Integer[size];
        for (int i = 0; i < size; i++) {
            ints[i] = sc.nextInt();
        }
        int sort = sc.nextInt();

        List<Integer> arrayList = new ArrayList<>(Arrays.asList(ints));
        if (sort == 0) {
            arrayList.sort((o1, o2) -> o1 - o2);
        } else {
            arrayList.sort((o1, o2) -> o2 - o1);
        }

        for (Integer integer : arrayList) {
            System.out.print(integer + " ");
        }
    }
}