一、题目链接
http://noi.openjudge.cn/ch0109/13/
二、解题思路
三、实施步骤
四、Java程序
import java.util.Arrays;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
public class Main {
public int[] removeDuplicates(int[] nums) {
Set<Integer> set = new TreeSet<>();
int n = nums.length;
int[] ans = new int[n];
int m = 0;
for (int e : nums) {
if (set.add(e)) {
ans[m] = e;
m++;
}
}
return Arrays.copyOfRange(ans, 0, m);
}
public static void main(String[] args) {
Main test = new Main();
Scanner input = new Scanner(System.in);
int n = input.nextInt();
int[] nums = new int[n];
for (int i = 0; i < n; i++) {
nums[i] = input.nextInt();
}
int[] ans = test.removeDuplicates(nums);
for (int e : ans) {
System.out.print(e + " ");
}
}
}