题解 | #明明的随机数#

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

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int times = in.nextInt();
        int[] number = new int[times];
        int[] finalNumber = new int[times];
        int uniqueCount = 0;

        for (int i = 0; i < times; i++) {
            number[i] = in.nextInt();
            boolean isUnique = true;
            for (int j = 0; j < uniqueCount; j++) {
                if (finalNumber[j] == number[i]) {
                    isUnique = false;
                    break;
                }
            }
            if (isUnique) {
                finalNumber[uniqueCount] = number[i];
                uniqueCount++;
            }
        }

        // 仅对有值部分的数组进行排序
        int[] resultArray = Arrays.copyOfRange(finalNumber, 0, uniqueCount);
        Arrays.sort(resultArray);
        for (int i = 0; i < uniqueCount; i++) {
            System.out.println(resultArray[i]);
        }
    }
}