一個(gè)數(shù)組，下標(biāo)從0到n，元素為從0到n的整數(shù)。判斷其中是否有重復(fù)元素
1 void Find_Duplicate(int a[],int n){
2
3 unsigned char* bitmap = new unsigned char[n];
4 memset(bitmap,0,n);
5 int count = 0;
6 for(int i=0; i<n; i++){
7 if(a[i]>n || a[i]<0)
8 continue;
9 else if( bitmap[a[i]] != 1)
10 bitmap[a[i]] = 1;
11 else
12 count++;
13 }
14 delete[] bitmap;
15 printf("Duplicate count: %d\n",count);
16 }