题解 | #在两个长度相等的排序数组中找到上中位数#

int index1=0,index2=0; int min=(arr1[0]<arr2[0])?arr1[0]:arr2[0]; int max=(arr1[arr1Len-1]<arr2[arr2Len-1])?arr1[arr1Len-1]:arr2[arr2Len-1]; //printf("(arr1Len+arr2Len)/2=%d\n",(arr1Len+arr2Len)/2); for(int i=min;i<=max;i++){ while(arr1[index1]<=i){ //printf("index1=%d arr1[%d]=%d \n",index1,index1,arr1[index1]); if(index1+index2+1==(arr1Len+arr2Len)/2){ //printf("the value returned is arr[%d]=%d\n",index1,arr1[index1]); return arr1[index1]; } index1++; } while(arr2[index2]<=i){ //printf("index2=%d arr2[%d]=%d \n",index2,index2,arr2[index2]); if(index1+index2+1==(arr1Len+arr2Len)/2){ //printf("the value returned is arr[%d]=%d\n",index2,arr2[index2]); return arr2[index2]; } index2++; } }