数组去重

来源：互联网发布：网店管家数据库编辑：程序博客网时间：2024/04/26 14:40

int uniq_element(int* a, int len){if(len <= 1){return len;}hash_set<int> myset;//数据插入hashsetfor (int i=0; i<len; i++)  myset.insert(a[i]);  return myset.size();}

int uniq_element(int* a, int len){ if(len <= 1) {  return len; }  set<int> myset; //数据插入set for (int i=0; i<len; i++)    myset.insert(a[i]);   return myset.size();}

int uniq_element(int* a, int len){if(len <= 1){return len;}//数组存入vector容器vector<int> myvector (a, a + len);vector<int>::iterator it;//排序sort(myvector.begin(), myvector.end());//去重it = unique (myvector.begin(), myvector.end());  //重置sizemyvector.resize( it - myvector.begin() );      return myvector.size();}

int uniq_element(int* a, int len){if(len <= 1){return len;}int num = 1; //保存独立元素个数int i, j; //暴力比较咯for(i = 1; i < len; i++){for(j = i - 1; j >= 0; j--){if(a[j] == a[i]){break;}else{continue;}}if(-1 == j){num++;}}return num;}int _tmain(int argc, _TCHAR* argv[]){int a[] = {1,2,3,1,2,3,3};int count = uniq_element(a, sizeof(a) / sizeof(int));cout << count << endl;system("pause");return 0;}