(Java)给定一个整数序列,KiKi想把其中的重复的整数去掉,并将去重后的序列从小到达排序输出。
先使用归并排序进行排序,然后输出时判断是否有重复的数。
import java.util.*;
public class Main
{
public static void main(String [] args)
{
Scanner cin = new Scanner(System.in);
int n = cin.nextInt();
int arr[] = new int[n];
for (int i = 0; i<n; i++)
arr[i]= cin.nextInt();
sortArrary(arr, 0, arr.length-1);
int temp = arr[0];
System.out.print(temp+" ");
for (int i=1; i<arr.length; i++)
{
if (temp == arr[i])
continue;
else
{
System.out.print(arr[i]+" ");
temp = arr[i];
}
}
}
public static void sortArrary(int arr[], int l, int r)
{
if (l == r)
return;
int mid = l + ((r-l)>>1);
sortArrary(arr, l, mid);
sortArrary(arr, mid+1, r);
merge(arr, l, mid, r);
}
public static void merge(int arr[], int l, int mid, int r)
{
int help[] = new int[r-l+1];
int i =0;
int p1 = l;
int p2 = mid+1;
while (p1 <= mid && p2 <= r)
help[i++] = arr[p1] <= arr[p2] ? arr[p1++]: arr[p2++];
while (p1 <= mid)
help[i++] = arr[p1++];
while (p2 <= r)
help[i++] = arr[p2++];
for (i =0; i<help.length; i++)
arr[l+i] = help[i];
}
}