import java.util.Scanner;
方法1
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int arr[] = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = sc.nextInt();
}
// 去重
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
if (arr[i] == arr[j]) {
for (int a = j; a < n - 1; a++) {
arr[a] = arr[a + 1];
}
j--;
n--;
}
}
}
// 排序
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (arr[i] > arr[j]) {
int a = arr[i];
arr[i] = arr[j];
arr[j] = a;
}
}
}
// 输出
System.out.println(n);
for (int i = 0; i < n - 1; i++) {
System.out.print(arr[i] + " ");
}
System.out.print(arr[n - 1]);
}
}
方法2
桶排序
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] arr = new int[1001];
int sum = 0;
for (int i = 0; i < n; i++) {
int temp = sc.nextInt();
arr[temp]++;
if (arr[temp] == 1) {
sum++;
}
}
System.out.println(sum);
for (int i = 0; i <= 1000; i++) {
if (arr[i] != 0) {
System.out.print(i + " ");
}
}
}
}