C++简单的去重代码(不需要set库)
原题地址NOI(1.10.9)
题解代码
#include<iostream>
using namespace std;
const int N = 1010;
int q[N],n;
int tmp[N];
void quick_sort(int q[], int l, int r){//快速排序
if(l >= r)
return;
int x = q[(l + r)/2],i = l - 1, j = r + 1;
while(i < j){
do i++; while(q[i] < x);
do j--; while(q[j] > x);
if(i < j) swap(q[i],q[j]);
}
quick_sort(q,l,j);
quick_sort(q, j + 1, r);
}
int main(){
int k = 0;
cin >> n;
for(int i = 0; i < n; i++) scanf("%d",&q[i]);
quick_sort(q,0,n - 1);
for(int i = 0; i < n; i++){//转化为集合
if(q[i] != q[i+1]) tmp[k++] = q[i];
else continue;
}
cout << k << endl;
for(int i = 0; i < k; i++) cout << tmp[i] << " ";
return 0;
}