查找两个排序数组的中间值--以升序数组为例

来源：互联网发布：mac抹掉系统后重装系统编辑：程序博客网时间：2024/06/05 10:25

</pre><pre name="code" class="cpp">int getMiddleValueOfBothAscendingArr(const int const p1[], const int len1, const int const p2[], const int len2){if (NULL == p1 || NULL == p2 || len1 < 1 || len2 < 1){return 0XFFFFFFFF;}int sS = 0;int sL = 0;int tS = 0;int tL = 0;int lenS = 0;int lenL = 0;int midS = 0;int midL = 0;int len = len1 + len2;const int* pS = NULL;const int* pL = NULL;if (len1 > len2){pS = p2;pL = p1;lenS = len2;lenL = len1;}else{pS = p1;pL = p2;lenS = len1;lenL = len2;}sS = 0;sL = 0;tS = lenS - 1;tL = lenL - 1;midS = (sS + tS) / 2;midL = (sL + tL) / 2;if (pS[lenS - 1] <= pL[(lenL - lenS) / 2 + 1]){return (pS[lenS - 1]>pL[(lenL - lenS) / 2]) ? pS[lenS - 1] : pL[(lenL - lenS) / 2];}else if (pL[lenL - 1] <= pS[0]){return pL[(len - 1) / 2];}cout << " middle1 = " << midS + 1 << " , middle2 = " << midL + 1 << endl;while (!(pS[midS - 1] <= pL[midL] && p2[midL] <= pS[midS + 1] && pL[midL - 1] <= pS[midS] && pS[midS] <= pL[midL + 1])){if (pS[midS] < pL[midL]){sS = midS;midS = (sS + tS + 1) / 2;midL -= (midS-sS);}else{tS = midS;midS = (sS + tS + 1) / 2;midL += (tS - midS);}cout << " middle1 = " << midS + 1 << " , middle2 = " << midL + 1 << endl;}if (pS[midS] < pL[midL]){return pL[midL];}else {return pS[midS];}}

0 0