不重复地输出数:双指针+qsort

快排+双指针去重

#include<iostream>
#include<vector>
using namespace std;
 int cmp(const void*a,const void*b)
 {
      return (*(int*)a-*(int*)b);
 }
int Deduplication(int*nums,int len)
{
    int fast = 0, high = 1;
    for (high = 1; high <len; ++high)
    {
        if (nums[high] != nums[fast])
        {
            nums[++fast] = nums[high];
        }
    }
    return fast + 1;
}
int main()
{
    int n;
    cin >> n;
    int * nums = new int [n];
    for (int i = 0; i < n; i++)
    {
        cin >> nums[i];
    }
   qsort(nums,n,sizeof(int),cmp);
    int size = Deduplication(nums,n);
    for (int i = 0; i < size; i++)
    {
        cout << nums[i] << ' ';
    }
    return 0;
}