1¡¢ ÉèÓÐÒ»¸öÊäÈëÊý¾ÝµÄÐòÁÐÊÇ { 46, 25, 78, 62, 12, 80 }, ÊÔ»³ö´Ó¿ÕÊ÷Æð£¬Öð¸öÊäÈë¸÷¸öÊý¾Ý¶øÉú³ÉµÄ¶þ²æËÑË÷Ê÷¡£
´ð°¸ÈçÏ£º
2¡¢ Ò»¸öÊý×飬ϱê´Ó0µ½n£¬ÔªËØΪ´Ó0µ½nµÄÕûÊý¡£ÅжÏÆäÖÐÊÇ·ñÓÐÖظ´ÔªËØ¡£
int hasDuplicate(int[]a,int n){
for(int i=0;i
while(a[i] != i && a[i] != -1){
if(a[a[i]] == -1){
return 1;
}
a[i] = a[a[i]];
a[a[i]] = -1;
}
if(a[i] == i){
a[i] = -1;
}
}
return 0;
}
3¡¢ Êý¾ÝµÄÎïÀí½á¹¹Ö÷Òª°üÀ¨ÄÄÁ½ÖÖÇé¿ö£¿
Êý¾ÝµÄÎïÀí½á¹¹Ö÷Òª°üÀ¨Ë³Ðò´æ´¢½á¹¹¡¢Á´Ê½´æ´¢½á¹¹Á½ÖÖÇé¿ö¡£
4¡¢ Éè¼ÆÔÚ˳ÐòÓÐÐò±íÖÐʵÏÖ¶þ·Ö²éÕÒµÄËã·¨¡£
struct record{
int key;
int others;
};
int bisearch(struct record r[], int k){
int low=0,mid,high=n-1;
while(low<=high){
mid=(low+high)/2;
if(r[mid].key==k){
return(mid+1);
}else if(r[mid].key>k){
high=mid-1;
}else{
low=mid+1;
}
}
return (0);
}
5¡¢ ¶ÔÒ»¸öËã·¨µÄÆÀ¼Û£¬°üÀ¨Äļ¸¸ö·½ÃæµÄÄÚÈÝ£¿
1£©½¡×³ÐԺͿɶÁÐÔ
2£©ÕýÈ·ÐÔ
3£©Ê±¿Õ¸´ÔÓ¶È