#include<iostream>#include<vector>usingnamespace std;intmain(){int n;
cin >> n;int* arr =newint[n];for(int i =0; i < n; i++){
cin >> arr[i];}
vector<int> temp;
vector<int> Arr;for(int i =0; i < n; i++){int ret =0;for(int k =0; k < temp.size(); k++){if(arr[i]== temp[k]){
ret =1;//有相同的 记下标记}}if(ret ==0)//temp里没有相同的数{
Arr.push_back(arr[i]);for(int k = i +1; k < n; k++)//接下来判断这个数和后边有相同的没{if(arr[i]== arr[k]){
temp.push_back(arr[i]);}}}}for(int i =0; i < Arr.size(); i++){
cout << Arr[i]<<" ";}
cout << endl;return0;}
2.先排序,再去掉重复的
#include<iostream>#include<algorithm>#include<vector>usingnamespace std;intmain(){int n;
cin >> n;int* arr =newint[n];for(int i =0; i < n; i++){
cin >> arr[i];}sort(arr, arr + n);//排序int temp=arr[0];//从第一个开始
vector<int> Arr;
Arr.push_back(arr[0]);//先把第一个存了for(int i =0; i < n; i++){if(arr[i]!= temp)//看和前一个相等不,不相等进行{
temp = arr[i];
Arr.push_back( arr[i]);//存入数组}}for(int i =0; i < Arr.size(); i++){
cout << Arr[i]<<" ";}
cout << endl;return0;}