b**********5 发帖数: 7881 | 3 int findMedian (int[] A, int[] B) {
int aLen = A.length;
int bLen= B.length;
if (aLength+bLength % 2 == 0) {
return (helper(A, B, (aLen+bLen)/2, 0, aLen, 0, bLen) +
helper(A, B, (aLen+bLen)/2-1, 0, aLen, 0, bLen))/2;
}
else {
return helper(A, B, (aLen+bLen)/2, 0, aLen, 0, bLen);
}
}
int helper (int[] A, int[] B, int k, int aStart, int aEnd, int bstart, int
bEnd) {
int aLen = aEnd-aStart+1;
int bLen = bEnd-bStart+1;
if (a... 阅读全帖 |
|