數組排序去重：ios
1 #include <cstdlib> 2 #include <iostream> 3 #include <algorithm> 4 using namespace std; 5 bool cmp( int a, int b) 6 { 7 return a < b; 8 } 9 int main() 10 { 11 int a[20]; 12 for( int i = 0; i < 20; i++) 13 a[i] = rand()%10; 14 15 for( int i = 0; i < 20; i++) 16 printf("%d ", a[i]); 17 cout << endl << endl; 18 19 sort( a, a+20, cmp); 20 for( int i = 0; i < 20; i++) 21 printf("%d ", a[i]); 22 cout << endl << endl; 23 24 int len = unique( a, a+20)-a; 25 cout << len << endl << endl; 26 27 for( int i = 0; i < 20; i++) 28 printf("%d ", a[i]); 29 cout << endl << endl; 30 31 for( int i = 0; i < len; i++) 32 printf("%d ", a[i]); 33 cout << endl << endl; 34 35 return 0; 36 }