{"id":186,"date":"2022-02-26T19:32:00","date_gmt":"2022-02-26T11:32:00","guid":{"rendered":"http:\/\/nas.hepcloud.top:7000\/?p=186"},"modified":"2022-02-26T19:32:00","modified_gmt":"2022-02-26T11:32:00","slug":"4-%e5%af%bb%e6%89%be%e4%b8%a4%e4%b8%aa%e6%ad%a3%e5%ba%8f%e6%95%b0%e7%bb%84%e7%9a%84%e4%b8%ad%e4%bd%8d%e6%95%b0","status":"publish","type":"post","link":"http:\/\/www.huerpu.cc:7000\/?p=186","title":{"rendered":"4. \u5bfb\u627e\u4e24\u4e2a\u6b63\u5e8f\u6570\u7ec4\u7684\u4e2d\u4f4d\u6570"},"content":{"rendered":"\n

\u7ed9\u5b9a\u4e24\u4e2a\u5927\u5c0f\u5206\u522b\u4e3am<\/code>\u548cn<\/code>\u7684\u6b63\u5e8f(\u4ece\u5c0f\u5230\u5927)\u6570\u7ec4nums1<\/code>\u548cnums2<\/code>\u3002\u8bf7\u4f60\u627e\u51fa\u5e76\u8fd4\u56de\u8fd9\u4e24\u4e2a\u6b63\u5e8f\u6570\u7ec4\u7684\u4e2d\u4f4d\u6570<\/strong>\u3002<\/p>\n\n\n

\u7b97\u6cd5\u7684\u65f6\u95f4\u590d\u6742\u5ea6\u5e94\u8be5\u4e3aO(log(m+n))<\/code>\u3002<\/p>\n\n\n

\u793a\u4f8b 1\uff1a<\/strong><\/p>\n\n\n

\u8f93\u5165\uff1anums1 = [1,3], nums2 = [2]
\u8f93\u51fa\uff1a2.00000
\u89e3\u91ca\uff1a\u5408\u5e76\u6570\u7ec4 = [1,2,3] \uff0c\u4e2d\u4f4d\u6570 2<\/pre>\n\n\n

\u793a\u4f8b 2\uff1a<\/strong><\/p>\n\n\n
\u8f93\u5165\uff1anums1 = [1,2], nums2 = [3,4]
\u8f93\u51fa\uff1a2.50000
\u89e3\u91ca\uff1a\u5408\u5e76\u6570\u7ec4 = [1,2,3,4] \uff0c\u4e2d\u4f4d\u6570(2+3)\/2=2.5<\/pre>\n\n\n

\u63d0\u793a\uff1a<\/strong><\/p>\n\n\n
  • nums1.length == m<\/li>
  • nums2.length == n<\/li>
  • 0 <= m <= 1000<\/li>
  • 0 <= n <= 1000<\/li>
  • 1 <= m + n <= 2000<\/li>
  • -106<\/sup> <= nums1[i], nums2[i] <= 106<\/sup><\/li><\/ul>\n\n\n
    \u4e00\u3001\u57fa\u7840\u601d\u60f3\u89e3\u6cd5<\/h3>\n\n\n
    \u904d\u5386\u4e24\u4e2a\u6570\u7ec4\uff0c\u5c31\u662f\u4e00\u770b\u5230\u9898\u76ee\u5c31\u60f3\u5230\u7684\u90a3\u79cd\u7b97\u6cd5\u601d\u60f3\uff0c\u6761\u4ef6\u5f88\u591a\uff0c\u53c8\u81ed\u53c8\u957f\u3002\u65f6\u95f4\u590d\u6742\u5ea6: O(m+n)<\/code>, \u7a7a\u95f4\u590d\u6742\u5ea6: O(1)<\/code>\u3002<\/p>\n\n\n
    public  double findMedianSortedArrays(int[] nums1, int[] nums2) {
        double median = 0.0;
        int m = nums1.length, n = nums2.length;
        \/\/\u5206\u522b\u6307\u5411\u6570\u7ec4nums1\u548cnums2\u7684\u4e0b\u6807
        int mIdx = 0, nIdx = 0,temIdx = 0;
        \/\/\u4e2d\u4f4d\u6570\u7684\u4f4d\u7f6e
        int desIdx = (m + n + 1) \/ 2;
        \/\/\u662f\u5426\u4e3a\u4e24\u4e2a\u6570\u7684\u4e2d\u4f4d\u6570
        boolean isTwo = (m + n) % 2 == 0;
    \u200b
        while(temIdx <= desIdx || isTwo){
            temIdx++;
            \/\/\u4e24\u4e2a\u6570\u7ec4\u8fdb\u884c\u6bd4\u8f83\uff0c\u53d6\u6700\u5c0f\u7684\u90a3\u4e2a
            if(mIdx < m && nIdx < n && nums1[mIdx] <= nums2[nIdx]){
                if(temIdx == desIdx && !isTwo){\/\/\u5982\u679c\u53ea\u6709\u4e00\u4e2a\u4e2d\u4f4d\u6570\uff0c\u627e\u5230\u76f4\u63a5\u8fd4\u56de
                    return nums1[mIdx];
                }else if(temIdx == desIdx && isTwo){\/\/\u5982\u679c\u6709\u4e24\u4e2a\u4e2d\u4f4d\u6570\uff0c\u5e76\u4e14\u73b0\u5728\u6307\u5411\u4e86\u7b2c\u4e00\u4e2a\u6570\uff0c\u628a\u5b83\u8d4b\u7ed9media
                    median = nums1[mIdx];
                }else if(temIdx == desIdx + 1){\/\/\u5982\u679c\u6709\u4e24\u4e2a\u4e2d\u4f4d\u6570\uff0c\u5e76\u4e14\u73b0\u5728\u6307\u5411\u4e86\u7b2c\u4e8c\u4e2a\u6570\uff0c\u8fd4\u56de\u7ed3\u679c
                    return (median + nums1[mIdx]) \/ 2.0;
                }
                mIdx++;
            }else if(mIdx < m && nIdx < n && nums1[mIdx] > nums2[nIdx]){\/\/\/\/\u4e24\u4e2a\u6570\u7ec4\u8fdb\u884c\u6bd4\u8f83\uff0c\u53d6\u6700\u5c0f\u7684\u90a3\u4e2a
                if(temIdx == desIdx && !isTwo){
                    return nums2[nIdx];
                }else if(temIdx == desIdx && isTwo){
                    median = nums2[nIdx];
                }else if(temIdx == desIdx + 1){
                    return (median + nums2[nIdx]) \/ 2.0;
                }
                nIdx++;
            }else if(mIdx < m && nIdx == n){\/\/\u5f53\u6570\u7ec4num2\u5df2\u7ecf\u904d\u5386\u5b8c\uff0c\u800c\u6570\u636enums1\u8fd8\u6709\u6570\u636e
                if(temIdx == desIdx && !isTwo){
                    return nums1[mIdx];
                }else if(temIdx == desIdx  && isTwo){
                    return (nums1[mIdx] + nums1[++mIdx]) \/ 2.0;
                }else if(temIdx == desIdx + 1  && isTwo){
                    return (median + nums1[mIdx]) \/ 2.0;
                }
                mIdx++;
            }else if(nIdx < n && mIdx == m){\/\/\u5f53\u6570\u7ec4num1\u5df2\u7ecf\u904d\u5386\u5b8c\uff0c\u800c\u6570\u636enums2\u8fd8\u6709\u6570\u636e
                if(temIdx == desIdx && !isTwo){
                    return nums2[nIdx];
                }else if(temIdx == desIdx && isTwo){
                    return (nums2[nIdx] + nums2[++nIdx]) \/ 2.0;
                }else if(temIdx == desIdx + 1 && isTwo){
                    return  (median + nums2[nIdx]) \/ 2.0;
                }
                nIdx++;
            }
    \u200b
        }
        return median;
    }<\/pre>\n\n\n
    \u4e8c\u3001\u7cbe\u7b80\u89e3\u6cd5<\/h3>\n\n\n
    \u7528m\u8868\u793a\u7b2c\u4e00\u4e2a\u6570\u7ec4\u7684\u957f\u5ea6\uff0cn\u8868\u793a\u7b2c\u4e8c\u4e2a\u6570\u7ec4\u7684\u957f\u5ea6\uff0c\u5982\u679c\u603b\u957f\u5ea6\u4e3a\u5947\u6570\uff0c\u6bd4\u5982m=2\uff0cn=3\uff0c\u90a3\u4e48\u5faa\u73af\u5230(m+n)\/2 + 1=(2+3)\/2 + 1=3<\/code>\uff0c\u4e5f\u5c31\u662f\u53d6\u7b2c\u4e09\u4e2a\u6570\uff0c\u6982\u62ec\u6765\u8bf4\u662f\u7b2c(m+n)\/2 + 1<\/code>\u4e2a\u6570\u3002\u5982\u679c\u603b\u957f\u5ea6\u4e3a\u5076\u6570\uff0c\u6bd4\u5982m=2\uff0cn=2\uff0c\u90a3\u4e48\u5faa\u73af\u5230(m+n)\/2 + 1=(2+2)\/2 + 1=3<\/code>\uff0c\u53d6\u7b2c2\u4e2a\u548c\u7b2c3\u4e2a\u6570\uff0c\u6982\u62ec\u6765\u8bf4\u662f\u7b2c(m+n)\/2<\/code>\u548c(m+n)\/2 + 1<\/code>\u4e2a\u6570\u3002\u4f7f\u7528\u4e24\u4e2a\u53d8\u91cfpre\u548ccur\uff0cpre\u8868\u793a\u4e0a\u4e00\u6b21\u5faa\u73af\u4e2d\u627e\u5230\u7684\u6570\uff0ccur\u8868\u793a\u5f53\u524d\u5faa\u73af\u627e\u5230\u7684\u6570\uff0c\u6bcf\u6b21\u5728\u5f53\u524d\u5faa\u73af\u90fd\u628acur\u8d4b\u7ed9pre\uff0c\u8fd9\u6837\u5230\u6700\u540e\u4e00\u6b21\u627e\u5230\u7684\u7b2c(m+n)\/2<\/code>\u548c(m+n)\/2 + 1<\/code>\u4e2a\u6570\u5c31\u662fpre\u548ccur\uff0c\u5982\u679c\u603b\u957f\u5ea6\u4e3a\u5947\u6570\u76f4\u63a5\u53d6\u5f53\u524dcur\u5373\u53ef\u3002<\/p>\n\n\n
    \u5bf9\u4e8e\u4e24\u4e2a\u6570\u7ec4\u5206\u522b\u7528mIdx\u548cnIdx\u6807\u793a\u6570\u7ec4\u7684\u4e0b\u6807\uff0c\u5982\u679cnums2\u6570\u7ec4\u6b64\u523b\u5df2\u7ecf\u6ca1\u6709\u6570\u5b57\u4e86\uff0c\u7ee7\u7eed\u53d6\u6570\u5b57 nums2[nIdx]<\/code>\uff0c\u5219\u4f1a\u8d8a\u754c\uff0c\u6240\u4ee5\u5224\u65adnIdx\u662f\u5426\u5927\u4e8e\u6570\u7ec4\u957f\u5ea6\uff0c\u8fd9\u6837 || \u540e\u8fb9\u7684\u5c31\u4e0d\u4f1a\u6267\u884c\u4e86\uff0c\u4e5f\u5c31\u4e0d\u4f1a\u5bfc\u81f4\u9519\u8bef\u4e86\uff0c\u6240\u4ee5\u589e\u52a0\u4e3amIdx < m && (nIdx >= n || nums1[mIdx] < nums2[nIdx])<\/code>\u3002<\/p>\n\n\n
    public double findMedianSortedArrays(int[] nums1, int[] nums2) {
        int m = nums1.length,n = nums2.length;
        int mIdx = 0, nIdx = 0;
        \/\/\u5faa\u73af\u4e24\u4e2a\u6570\u7ec4\uff0c\u6309\u4ece\u5c0f\u5230\u5927\u53bb\u83b7\u53d6\uff0c\u7136\u540e\u627e\u5230\u4e2d\u95f4\u70b9\u7684\u6570\uff0c\u6216\u8005\u4e2d\u95f4\u4e24\u4e2a\u6570\uff0c\u5728\u5bfb\u627e\u7684\u8fc7\u7a0b\u4e2d\uff0cpre\u8bb0\u5f55\u4e0a\u4e00\u4e2a\u503c\uff0ccur\u8bb0\u5f55\u5f53\u524d\u503c\u3002
        int pre = 0, cur = 0;
        \/\/i\u4ece0\u5230(m + n) \/ 2\uff0c\u5f53m + n\u4e3a\u5076\u6570\u65f6\uff0ci\u5faa\u73af\u5230\u4e2d\u95f4\u4e24\u4e2a\u6570\u7684\u540e\u4e00\u4e2a\uff0c\u5f53m + n\u4e3a\u5947\u6570\u65f6\uff0ci\u5faa\u73af\u5230\u4e2d\u95f4\u90a3\u4e2a\u6570
        for(int i = 0; i < (m + n) \/ 2 + 1; i++){
            pre = cur;
            if(mIdx < m && (nIdx >= n || nums1[mIdx] < nums2[nIdx])){
                cur = nums1[mIdx++];
            }else{
                cur = nums2[nIdx++];
            }
        }
    \u200b
        \/\/\u4e24\u4e2a\u6570\u7684\u65f6\u5019\uff0c\u53d6pre\u548ccur\u7684\u5e73\u5747
        if((m + n) % 2 == 0){
            return (pre + cur) \/ 2.0;
        }else{\/\/\u5426\u5219\u8fd4\u56decur
            return cur;
        }
    \u200b
    }<\/pre>\n\n\n
    \u4e09\u3001\u4e8c\u5206\u67e5\u627e\u89e3\u6cd5<\/h3>\n\n\n
    \u6839\u636e\u4e2d\u4f4d\u6570\u7684\u5b9a\u4e49\uff0c\u5f53m+n<\/code>\u662f\u5947\u6570\u65f6\uff0c\u4e2d\u4f4d\u6570\u662f\u4e24\u4e2a\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u7b2c(m+n)\/2+1<\/code>\u4e2a\u5143\u7d20\uff0c\u5f53m+n<\/code>\u662f\u5076\u6570\u65f6\uff0c\u4e2d\u4f4d\u6570\u662f\u4e24\u4e2a\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u7b2c(m+n)\/2<\/code>\u4e2a\u5143\u7d20\u548c\u7b2c(m+n)\/2+1<\/code>\u4e2a\u5143\u7d20\u7684\u5e73\u5747\u503c\u3002\u56e0\u6b64\uff0c\u8fd9\u9053\u9898\u53ef\u4ee5\u8f6c\u5316\u6210\u5bfb\u627e\u4e24\u4e2a\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u7b2ck\u5c0f\u7684\u6570\uff0c\u5176\u4e2dk\u4e3a(m+n)\/2<\/code>\u6216(m+n)\/2+1<\/code>\u3002<\/p>\n\n\n
    \u5047\u8bbe\u4e24\u4e2a\u6709\u5e8f\u6570\u7ec4\u5206\u522b\u662f A \u548c B\u3002\u8981\u627e\u5230\u7b2c k \u4e2a\u5143\u7d20\uff0c\u6211\u4eec\u53ef\u4ee5\u6bd4\u8f83 A[k\/2\u22121]<\/code> \u548c B[k\/2\u22121]<\/code>\uff0c\u5176\u4e2d\/\u8868\u793a\u6574\u6570\u9664\u6cd5\u3002\u7531\u4e8eA[k\/2\u22121]<\/code> \u548cB[k\/2\u22121]<\/code> \u7684\u524d\u9762\u5206\u522b\u6709 A[0...k\/2\u22122]<\/code>\u548c B[0...k\/2\u22122]<\/code>\uff0c\u5373 k\/2\u22121<\/code> \u4e2a\u5143\u7d20\uff0c\u5bf9\u4e8e A[k\/2\u22121]<\/code>\u548c B[k\/2\u22121]<\/code>\u4e2d\u7684\u8f83\u5c0f\u503c\uff0c\u6700\u591a\u53ea\u4f1a\u6709(k\/2-1)+(k\/2-1) = k\u22122<\/code>\u4e2a\u5143\u7d20\u6bd4\u5b83\u5c0f\uff0c\u90a3\u4e48\u5b83\u5c31\u4e0d\u80fd\u662f\u7b2c k \u5c0f\u7684\u6570\u4e86\u3002<\/p>\n\n\n
    \u6709\u4ee5\u4e0b\u4e09\u79cd\u60c5\u51b5\u9700\u8981\u7279\u6b8a\u5904\u7406\uff1a<\/p>\n\n\n
    • \u5982\u679cA[k\/2\u22121]<\/code>\u6216\u8005 B[k\/2\u22121]<\/code>\u8d8a\u754c\uff0c\u90a3\u4e48\u6211\u4eec\u53ef\u4ee5\u9009\u53d6\u5bf9\u5e94\u6570\u7ec4\u4e2d\u7684\u6700\u540e\u4e00\u4e2a\u5143\u7d20\u3002\u5728\u8fd9\u79cd\u60c5\u51b5\u4e0b\uff0c\u6211\u4eec\u5fc5\u987b\u6839\u636e\u6392\u9664\u6570\u7684\u4e2a\u6570\u51cf\u5c11k\u7684\u503c\uff0c\u800c\u4e0d\u80fd\u76f4\u63a5\u5c06k<\/code>\u51cf\u53bbk\/2-1<\/code>\u3002<\/li>
    • \u5982\u679c\u4e00\u4e2a\u6570\u7ec4\u4e3a\u7a7a\uff0c\u8bf4\u660e\u8be5\u6570\u7ec4\u4e2d\u7684\u6240\u6709\u5143\u7d20\u90fd\u88ab\u6392\u9664\uff0c\u6211\u4eec\u53ef\u4ee5\u76f4\u63a5\u8fd4\u56de\u53e6\u4e00\u4e2a\u6570\u7ec4\u4e2d\u7b2c k \u5c0f\u7684\u5143\u7d20\u3002<\/li>
    • \u5982\u679ck=1\uff0c\u6211\u4eec\u53ea\u8981\u8fd4\u56de\u4e24\u4e2a\u6570\u7ec4\u9996\u5143\u7d20\u7684\u6700\u5c0f\u503c\u5373\u53ef\u3002<\/li><\/ul>\n\n\n
      \u4e3b\u8981\u601d\u8def\uff1a\u8981\u627e\u5230\u7b2c k(k>1)<\/code> \u5c0f\u7684\u5143\u7d20\uff0c\u90a3\u4e48\u5c31\u53d6 A[k\/2-1]<\/code> \u548c B[k\/2-1]<\/code>\u8fdb\u884c\u6bd4\u8f83\u3002A \u4e2d\u5c0f\u4e8e\u7b49\u4e8e A[k\/2-1]<\/code>\u7684\u5143\u7d20\u6709 A[0 .. k\/2-2]<\/code>\u5171\u8ba1 k\/2-1<\/code>\u4e2a\uff0cB \u4e2d\u5c0f\u4e8e\u7b49\u4e8e B[k\/2-1]<\/code>\u7684\u5143\u7d20\u6709B[0 .. k\/2-2]<\/code>\u5171\u8ba1k\/2-1<\/code>\u4e2a\u3002\u53d6 min(A[k\/2-1], B[k\/2-1])<\/code>\uff0c\u4e24\u4e2a\u6570\u7ec4\u4e2d\u5c0f\u4e8e\u7b49\u4e8e min(A[k\/2-1], B[k\/2-1])<\/code>\u7684\u5143\u7d20\u5171\u8ba1\u4e0d\u4f1a\u8d85\u8fc7 (k\/2-1) + (k\/2-1) = k-2<\/code>\u4e2a\uff0c\u8fd9\u6837 min(A[k\/2-1], B[k\/2-1])<\/code> \u672c\u8eab\u6700\u5927\u4e5f\u53ea\u80fd\u662f\u7b2c k-1 \u5c0f\u7684\u5143\u7d20\u3002 \u5982\u679c A[k\/2-1] <= B[k\/2-1]<\/code>\uff0c\u90a3\u4e48 A[0 ... k\/2-1]<\/code>\u90fd\u4e0d\u53ef\u80fd\u662f\u7b2c k \u5c0f\u7684\u5143\u7d20\u3002\u628a\u8fd9\u4e9b\u5143\u7d20\u5168\u90e8 "\u5220\u9664"\uff0c\u5269\u4e0b\u7684\u4f5c\u4e3a\u65b0\u7684 A \u6570\u7ec4\uff1b\u5982\u679c A[k\/2-1] > B[k\/2-1]<\/code>\uff0c\u90a3\u4e48 B[0 ... k\/2-1]<\/code>\u90fd\u4e0d\u53ef\u80fd\u662f\u7b2c k \u5c0f\u7684\u5143\u7d20\u3002\u628a\u8fd9\u4e9b\u5143\u7d20\u5168\u90e8 "\u5220\u9664"\uff0c\u5269\u4e0b\u7684\u4f5c\u4e3a\u65b0\u7684 B \u6570\u7ec4\u3002\u7531\u4e8e\u6211\u4eec "\u5220\u9664" \u4e86\u4e00\u4e9b\u5143\u7d20(\u8fd9\u4e9b\u5143\u7d20\u90fd\u6bd4\u7b2c k \u5c0f\u7684\u5143\u7d20\u8981\u5c0f)\uff0c\u56e0\u6b64\u9700\u8981\u4fee\u6539 k \u7684\u503c\uff0c\u51cf\u53bb\u5220\u9664\u7684\u6570\u7684\u4e2a\u6570(k\/2-1)\u3002"\u5220\u9664"\u662f\u5728indxA\u548cindxB\u4e3a\u57fa\u7ebf\uff0c\u6bd4\u5982A[0 ... k\/2-1]<\/code>\u5c31\u662fA[indxA ... indxA + k\/2-1]<\/code>,B[0 ... k\/2-1]<\/code>\u5c31\u662fB[indxB ... indxB + k\/2-1]<\/code>\uff0c\u5220\u9664\u65f6\u66f4\u65b0indxA\u548cindxB\u5373\u53ef\u3002<\/p>\n\n\n
      \/\/3.\u91c7\u7528\u4e8c\u5206\u67e5\u627e
      \/\/\u65f6\u95f4\u590d\u6742\u5ea6: O(log(m+n)), \u7a7a\u95f4\u590d\u6742\u5ea6: O(1)
      public double findMedianSortedArrays(int[] A, int[] B) {
          int lenA = A.length, lenB = B.length;
          int len = lenA + lenB;
          \/\/\u5982\u679c\u662f\u4e2d\u95f4\u4e00\u4e2a\u6570\u4e3a\u4e2d\u4f4d\u6570
          if (len % 2 == 1) {
              \/\/\u6bd4\u5982lenA = 2\uff0clenB = 3\uff0c\u4e00\u51715\u4e2a\u6570\u90a3\u5c31\u53d6\u7b2c3\u4e2a\u6570\uff0c\u4e5f\u5c31\u662f(lenA + lenB) \/ 2 + 1
              int midIndx = len \/ 2 + 1;
              return getKthElement(A, B, midIndx);
          } else {
              \/\/\u5982\u679c\u662f\u4e2d\u95f4\u4e24\u4e2a\u6570\u4e3a\u4e2d\u4f4d\u6570\uff0c\u6bd4\u5982lenA = 2\uff0clenB = 2\uff0c\u4e00\u5171\u56db\u4e2a\u6570\uff0c\u90a3\u5c31\u53d6\u7b2c2\u4e2a\u548c\u7b2c3\u4e2a\uff0c\u4e5f\u5c31\u662f(lenA + lenB) \/ 2 \u548c (lenA + lenB) \/ 2 + 1
              int midIndx= len \/ 2, midIndx2 = len \/ 2 + 1;
              return (getKthElement(A, B, midIndx) + getKthElement(A, B, midIndx2)) \/ 2.0;
          }
      }
      \u200b
      \/** \u4e3b\u8981\u601d\u8def\uff1a\u8981\u627e\u5230\u7b2c k(k>1) \u5c0f\u7684\u5143\u7d20\uff0c\u90a3\u4e48\u5c31\u53d6 A[k\/2-1] \u548c B[k\/2-1] \u8fdb\u884c\u6bd4\u8f83
       * A \u4e2d\u5c0f\u4e8e\u7b49\u4e8e A[k\/2-1] \u7684\u5143\u7d20\u6709 A[0 .. k\/2-2] \u5171\u8ba1 k\/2-1 \u4e2a
       * B \u4e2d\u5c0f\u4e8e\u7b49\u4e8e B[k\/2-1] \u7684\u5143\u7d20\u6709 B[0 .. k\/2-2] \u5171\u8ba1 k\/2-1 \u4e2a
       * \u53d6 min(A[k\/2-1], B[k\/2-1])\uff0c\u4e24\u4e2a\u6570\u7ec4\u4e2d\u5c0f\u4e8e\u7b49\u4e8e min(A[k\/2-1], B[k\/2-1]) \u7684\u5143\u7d20\u5171\u8ba1\u4e0d\u4f1a\u8d85\u8fc7 (k\/2-1) + (k\/2-1) = k-2 \u4e2a
       * \u8fd9\u6837 min(A[k\/2-1], B[k\/2-1]) \u672c\u8eab\u6700\u5927\u4e5f\u53ea\u80fd\u662f\u7b2c k-1 \u5c0f\u7684\u5143\u7d20
       * \u5982\u679c A[k\/2-1] <= B[k\/2-1]\uff0c\u90a3\u4e48 A[0 ... k\/2-1] \u90fd\u4e0d\u53ef\u80fd\u662f\u7b2c k \u5c0f\u7684\u5143\u7d20\u3002\u628a\u8fd9\u4e9b\u5143\u7d20\u5168\u90e8 \"\u5220\u9664\"\uff0c\u5269\u4e0b\u7684\u4f5c\u4e3a\u65b0\u7684 A \u6570\u7ec4
       * \u5982\u679c A[k\/2-1] > B[k\/2-1]\uff0c\u90a3\u4e48 B[0 ... k\/2-1] \u90fd\u4e0d\u53ef\u80fd\u662f\u7b2c k \u5c0f\u7684\u5143\u7d20\u3002\u628a\u8fd9\u4e9b\u5143\u7d20\u5168\u90e8 \"\u5220\u9664\"\uff0c\u5269\u4e0b\u7684\u4f5c\u4e3a\u65b0\u7684 B \u6570\u7ec4
       * \u7531\u4e8e\u6211\u4eec \"\u5220\u9664\" \u4e86\u4e00\u4e9b\u5143\u7d20(\u8fd9\u4e9b\u5143\u7d20\u90fd\u6bd4\u7b2c k \u5c0f\u7684\u5143\u7d20\u8981\u5c0f)\uff0c\u56e0\u6b64\u9700\u8981\u4fee\u6539 k \u7684\u503c\uff0c\u51cf\u53bb\u5220\u9664\u7684\u6570\u7684\u4e2a\u6570
       * \"\u5220\u9664\"\u662f\u5728indxA\u548cindxB\u4e3a\u57fa\u7ebf\uff0c\u6bd4\u5982A[0 ... k\/2-1]\u5c31\u662fA[indxA ... indxA + k\/2-1],  B[0 ... k\/2-1]\u5c31\u662fB[indxB ... indxB + k\/2-1]\uff0c\u5220\u9664\u65f6\u66f4\u65b0indxA\u548cindxB\u5373\u53ef
       *\/
      public int getKthElement(int[] A, int[] B, int k) {
          int lenA = A.length, lenB = B.length;
          int indxA = 0, indxB = 0;
      \u200b
          while (true) {
              \/\/\u5f53A\u5df2\u7ecf\u5b8c\u5168\u6392\u9664\u4e86\uff0c\u90a3\u5c31\u76f4\u63a5\u8fd4\u56deB\u4e2d\u7b2ck\u4e2a\u5143\u7d20\u7684\u503c
              \/\/\u8fd9\u4e2a\u7b2ck\u4e2a\u5143\u7d20\u662f\u5728indxB\u7684\u57fa\u7840\u4e4b\u4e0a\u7684\u504f\u79fb\u91cf\uff0c\u5373B[indxB,...,indxB+(k-1),...]
              if (indxA == lenA ) {
                  return B[indxB + (k - 1)];
              }else if (indxB == lenB) {\/\/\u5f53B\u5df2\u7ecf\u5b8c\u5168\u6392\u9664\u4e86\uff0c\u90a3\u5c31\u76f4\u63a5\u8fd4\u56deA\u4e2d\u7b2ck\u4e2a\u5143\u7d20\u7684\u503c
                  return A[indxA + (k - 1)];
              }else if (k == 1) {\/\/\u5982\u679c\u73b0\u5728\u8981\u8fd4\u56de\u7b2c\u4e00\u4e2a\u5143\u7d20\uff0c\u5373k=1\uff0c\u90a3\u4e48\u5c31\u8fd4\u56deA\u548cB\u7b2c\u4e00\u4e2a\u5143\u7d20\u4e2d\u6700\u5c0f\u7684\u90a3\u4e2a\u5c31\u597d
                  return Math.min(A[indxA], B[indxB]);
              }
      \u200b
              \/\/\u5728\u6570\u7ec4A\u4e2d\uff0c\u9009\u62e9\u4eceindxA\u5f00\u59cb\u7b97\u8d77\uff0c\u7b2c k\/2 \u4e2a\u5143\u7d20\u6216\u8005\u6570\u7ec4\u7684\u6700\u540e\u4e00\u4e2a\uff0c\u4e5f\u5c31\u662f\u5f53\u524d\u6570\u7ec4A\u4e2d\u8981\u4e0eB\u6bd4\u8f83\u7684\u90a3\u4e2a\u5143\u7d20\u7684\u4e0b\u6807\uff0c\u8fd9\u4e5f\u662f\u4e3a\u4e86\u9632\u6b62\u4e0b\u6807\u8d8a\u754c
              int tempIndxA = Math.min(indxA + k \/ 2 - 1, lenA - 1);
              \/\/\u5728\u6570\u7ec4B\u4e2d\uff0c\u9009\u62e9\u4eceindxB\u5f00\u59cb\u7b97\u8d77\uff0c\u7b2ck \/ 2\u4e2a\u5143\u7d20\u6216\u8005\u6570\u7ec4\u7684\u6700\u540e\u4e00\u4e2a\uff0c\u4e5f\u5c31\u662f\u5f53\u524d\u6570\u7ec4B\u4e2d\u8981\u4e0eA\u6bd4\u8f83\u7684\u90a3\u4e2a\u5143\u7d20\u7684\u4e0b\u6807
              int tempIndxB = Math.min(indxB + k \/ 2 - 1, lenB - 1);
      \u200b
              \/\/\u5982\u679cA[tempIndxA] \u5c0f\u4e8e\u7b49\u4e8e B[tempIndxB]\uff0c\u5219\u6392\u9664A[indxA,...,tempIndxA]=tempIndxA - indxA + 1\u4e2a\u5143\u7d20
              if (A[tempIndxA] <= B[tempIndxB]) {
                  k = k - (tempIndxA - indxA + 1);\/\/\u76ee\u524d\u662f\u8981\u627e\u7b2ck\u4e2a\u5143\u7d20\uff0c\u6392\u9664\u4e86tempIndxA - indxA + 1\u4e2a\uff0c\u6240\u4ee5k\u8981\u51cf\u53bb\u76f8\u5e94\u6570\u91cf
                  indxA = tempIndxA + 1;\/\/indxA\u6307\u5411\u540e\u9762\u4e00\u4e2a\u5143\u7d20\uff0c\u56e0\u4e3a\u524d\u9762A[indxA,...,tempIndxA]\u4e2a\u5143\u7d20\u90fd\u6392\u9664\u4e86
              } else {
                  k = k - (tempIndxB - indxB + 1);
                  indxB = tempIndxB + 1;
              }
          }
      }<\/pre>\n\n\n
      \u56db\u3001\u5212\u5206\u6570\u7ec4\u89e3\u6cd5<\/h3>\n\n\n
      \u4e2d\u4f4d\u6570\u7684\u5b9a\u4e49\uff1a\u5c06\u4e00\u4e2a\u96c6\u5408\u5212\u5206\u4e3a\u4e24\u4e2a\u957f\u5ea6\u76f8\u7b49\u7684\u5b50\u96c6\uff0c\u5176\u4e2d\u4e00\u4e2a\u5b50\u96c6\u4e2d\u7684\u5143\u7d20\u603b\u662f\u5927\u4e8e\u53e6\u4e00\u4e2a\u5b50\u96c6\u4e2d\u7684\u5143\u7d20\u3002<\/p>\n\n\n
      \u9996\u5148\uff0c\u5728\u4efb\u610f\u4f4d\u7f6e i \u5c06A \u5212\u5206\u6210\u4e24\u4e2a\u90e8\u5206\uff1a<\/p>\n\n\n
             left_A            |          right_A<\/pre>\n\n\n
      A[0], A[1], ..., A[i-1]  |  A[i], A[i+1], ..., A[m-1]<\/pre>\n\n\n
      \u7531\u4e8e A \u4e2d\u6709 m \u4e2a\u5143\u7d20\uff0c \u6240\u4ee5\u6709 m+1 \u79cd\u5212\u5206\u7684\u65b9\u6cd5(i\u2208[0,m])<\/code>\u3002<\/p>\n\n\n
      len(left_A)=i<\/em>,len(right_A)=m<\/em>\u2212i<\/em>.<\/p>\n\n\n
      \u6ce8\u610f\uff1a\u5f53 i = 0\u65f6\uff0cleft_A \u4e3a\u7a7a\u96c6\uff0c \u800c\u5f53 i = m \u65f6, right_A \u4e3a\u7a7a\u96c6\u3002<\/p>\n\n\n
      \u91c7\u7528\u540c\u6837\u7684\u65b9\u5f0f\uff0c\u5728\u4efb\u610f\u4f4d\u7f6e j \u5c06 B \u5212\u5206\u6210\u4e24\u4e2a\u90e8\u5206\uff1a<\/p>\n\n\n
             left_B            |          right_B
      B[0], B[1], ..., B[j-1]  |  B[j], B[j+1], ..., B[n-1]<\/pre>\n\n\n
      \u5c06left_A \u548c left_B \u653e\u5165\u4e00\u4e2a\u96c6\u5408\uff0c\u5e76\u5c06right_A \u548cright_B\u653e\u5165\u53e6\u4e00\u4e2a\u96c6\u5408\u3002 \u518d\u628a\u8fd9\u4e24\u4e2a\u65b0\u7684\u96c6\u5408\u5206\u522b\u547d\u540d\u4e3a left_part \u548c right_part\uff1a<\/p>\n\n\n
      <\/pre>\n\n\n
            left_part          |         right_part<\/pre>\n\n\n
      A[0], A[1], ..., A[i-1]  |  A[i], A[i+1], ..., A[m-1]<\/pre>\n\n\n
      B[0], B[1], ..., B[j-1]  |  B[j], B[j+1], ..., B[n-1]<\/pre>\n\n\n
      \u5f53 A \u548c B \u7684\u603b\u957f\u5ea6\u662f\u5076\u6570\u65f6\uff0c\u5982\u679c\u53ef\u4ee5\u786e\u8ba4\uff1a<\/p>\n\n\n
      • len(left_part)=len(right_part)<\/li>
      • max(left_part)\u2264min(right_part)<\/li><\/ul>\n\n\n
        \u90a3\u4e48\uff0c{A,B} \u4e2d\u7684\u6240\u6709\u5143\u7d20\u5df2\u7ecf\u88ab\u5212\u5206\u4e3a\u76f8\u540c\u957f\u5ea6\u7684\u4e24\u4e2a\u90e8\u5206\uff0c\u4e14\u524d\u4e00\u90e8\u5206\u4e2d\u7684\u5143\u7d20\u603b\u662f\u5c0f\u4e8e\u6216\u7b49\u4e8e\u540e\u4e00\u90e8\u5206\u4e2d\u7684\u5143\u7d20\u3002\u4e2d\u4f4d\u6570\u5c31\u662f\u524d\u4e00\u90e8\u5206\u7684\u6700\u5927\u503c\u548c\u540e\u4e00\u90e8\u5206\u7684\u6700\u5c0f\u503c\u7684\u5e73\u5747\u503c\uff1a<\/p>\n\n\n
        median=(max(left_part)+min(right_part))\/2<\/p>\n\n\n
        \u5f53 A \u548c B \u7684\u603b\u957f\u5ea6\u662f\u5947\u6570\u65f6\uff0c\u5982\u679c\u53ef\u4ee5\u786e\u8ba4\uff1a<\/p>\n\n\n
        • en(left_part)=len(right_part)+1<\/li>
        • max(left_part)\u2264min(right_part)<\/li><\/ul>\n\n\n
          \u90a3\u4e48\uff0c{A,B} \u4e2d\u7684\u6240\u6709\u5143\u7d20\u5df2\u7ecf\u88ab\u5212\u5206\u4e3a\u4e24\u4e2a\u90e8\u5206\uff0c\u524d\u4e00\u90e8\u5206\u6bd4\u540e\u4e00\u90e8\u5206\u591a\u4e00\u4e2a\u5143\u7d20\uff0c\u4e14\u524d\u4e00\u90e8\u5206\u4e2d\u7684\u5143\u7d20\u603b\u662f\u5c0f\u4e8e\u6216\u7b49\u4e8e\u540e\u4e00\u90e8\u5206\u4e2d\u7684\u5143\u7d20\u3002\u4e2d\u4f4d\u6570\u5c31\u662f\u524d\u4e00\u90e8\u5206\u7684\u6700\u5927\u503c\uff1a<\/p>\n\n\n
          \u200b<\/p>\n\n\n
          \u7b2c\u4e00\u4e2a\u6761\u4ef6\u5bf9\u4e8e\u603b\u957f\u5ea6\u662f\u5076\u6570\u548c\u5947\u6570\u7684\u60c5\u51b5\u6709\u6240\u4e0d\u540c\uff0c\u4f46\u662f\u53ef\u4ee5\u5c06\u4e24\u79cd\u60c5\u51b5\u5408\u5e76\u3002\u7b2c\u4e8c\u4e2a\u6761\u4ef6\u5bf9\u4e8e\u603b\u957f\u5ea6\u662f\u5076\u6570\u548c\u5947\u6570\u7684\u60c5\u51b5\u662f\u4e00\u6837\u7684\u3002<\/p>\n\n\n
          \u8981\u786e\u4fdd\u8fd9\u4e24\u4e2a\u6761\u4ef6\uff0c\u53ea\u9700\u8981\u4fdd\u8bc1\uff1a<\/p>\n\n\n
          • i + j = m - i + n - j<\/code>(\u5f53 m+n\u4e3a\u5076\u6570)\u6216i + j = m - i + n - j + 1<\/code>(\u5f53 m+n\u4e3a\u5947\u6570)\u3002\u7b49\u53f7\u5de6\u4fa7\u4e3a\u524d\u4e00\u90e8\u5206\u7684\u5143\u7d20\u4e2a\u6570\uff0c\u7b49\u53f7\u53f3\u4fa7\u4e3a\u540e\u4e00\u90e8\u5206\u7684\u5143\u7d20\u4e2a\u6570\u3002\u5c06 i \u548c j \u5168\u90e8\u79fb\u5230\u7b49\u53f7\u5de6\u4fa7\uff0c\u6211\u4eec\u5c31\u53ef\u4ee5\u5f97\u5230 \u200b\u3002\u8fd9\u91cc\u7684\u5206\u6570\u7ed3\u679c\u53ea\u4fdd\u7559\u6574\u6570\u90e8\u5206\u3002<\/li>
          • 0\u2264i\u2264m\uff0c0\u2264j\u2264n<\/code>\u3002\u5982\u679c\u6211\u4eec\u89c4\u5b9a A \u7684\u957f\u5ea6\u5c0f\u4e8e\u7b49\u4e8e B \u7684\u957f\u5ea6\uff0c\u5373 m\u2264n\u3002\u8fd9\u6837\u5bf9\u4e8e\u4efb\u610f\u7684i\u2208[0,m]<\/code>\uff0c\u90fd\u6709\u200b\u2208[0,n]\uff0c\u90a3\u4e48\u6211\u4eec\u5728 [0,m] \u7684\u8303\u56f4\u5185\u679a\u4e3e i \u5e76\u5f97\u5230 j \uff0c\u5c31\u4e0d\u9700\u8981\u989d\u5916\u7684\u6027\u8d28\u4e86\u3002
            • \u5982\u679cA \u7684\u957f\u5ea6\u8f83\u5927\uff0c\u90a3\u4e48\u6211\u4eec\u53ea\u8981\u4ea4\u6362A \u548c B \u5373\u53ef\u3002<\/li>
            • \u5982\u679c m > n \uff0c\u90a3\u4e48\u5f97\u51fa\u7684 j\u6709\u53ef\u80fd\u662f\u8d1f\u6570\u3002<\/li><\/ul><\/li>
            • B[j\u22121]\u2264A[i]<\/code>\u4ee5\u53caA[i\u22121]\u2264B[j]<\/code>\uff0c\u5373\u524d\u4e00\u90e8\u5206\u7684\u6700\u5927\u503c\u5c0f\u4e8e\u7b49\u4e8e\u540e\u4e00\u90e8\u5206\u7684\u6700\u5c0f\u503c\u3002<\/li><\/ul>\n\n\n
              \u4e3a\u4e86\u7b80\u5316\u5206\u6790\uff0c\u5047\u8bbeA[i\u22121],B[j\u22121],A[i],B[j]<\/code>\u603b\u662f\u5b58\u5728\u3002\u5bf9\u4e8ei=0\u3001i=m\u3001j=0\u3001j=n<\/code>\u8fd9\u6837\u7684\u4e34\u754c\u6761\u4ef6\uff0c\u6211\u4eec\u53ea\u9700\u8981\u89c4\u5b9a A[\u22121]=B[\u22121]=\u2212\u221e\uff0cA[m]=B[n]=\u221e<\/code>\u5373\u53ef\u3002\u8fd9\u4e5f\u662f\u6bd4\u8f83\u76f4\u89c2\u7684\uff1a\u5f53\u4e00\u4e2a\u6570\u7ec4\u4e0d\u51fa\u73b0\u5728\u524d\u4e00\u90e8\u5206\u65f6\uff0c\u5bf9\u5e94\u7684\u503c\u4e3a\u8d1f\u65e0\u7a77\uff0c\u5c31\u4e0d\u4f1a\u5bf9\u524d\u4e00\u90e8\u5206\u7684\u6700\u5927\u503c\u4ea7\u751f\u5f71\u54cd\uff1b\u5f53\u4e00\u4e2a\u6570\u7ec4\u4e0d\u51fa\u73b0\u5728\u540e\u4e00\u90e8\u5206\u65f6\uff0c\u5bf9\u5e94\u7684\u503c\u4e3a\u6b63\u65e0\u7a77\uff0c\u5c31\u4e0d\u4f1a\u5bf9\u540e\u4e00\u90e8\u5206\u7684\u6700\u5c0f\u503c\u4ea7\u751f\u5f71\u54cd\u3002<\/p>\n\n\n
              \u6240\u4ee5\u6211\u4eec\u9700\u8981\u505a\u7684\u662f\uff1a<\/p>\n\n\n
              \u5728 [0, m]\u4e2d\u627e\u5230 i\uff0c\u4f7f\u5f97\uff1a<\/p>\n\n\n
              B[j\u22121]\u2264A[i] \u4e14 A[i\u22121]\u2264B[j]\uff0c\u5176\u4e2d \u200bj = (m + n + 1)\/2 – i<\/p>\n\n\n
              \u6211\u4eec\u8bc1\u660e\u5b83\u7b49\u4ef7\u4e8e\uff1a<\/p>\n\n\n
              \u5728 [0, m]\u4e2d\u627e\u5230\u6700\u5927\u7684 i\uff0c\u4f7f\u5f97\uff1a<\/p>\n\n\n
              A[i\u22121]\u2264B[j]\uff0c\u5176\u4e2d\u200b\u200b\u200bj = (m + n + 1)\/2 – i<\/p>\n\n\n
              \u8fd9\u662f\u56e0\u4e3a\uff1a<\/p>\n\n\n
              • \u5f53 i\u4ece0\u223cm \u9012\u589e\u65f6\uff0cA[i\u22121] \u9012\u589e\uff0cB[j] \u9012\u51cf\uff0c\u6240\u4ee5\u4e00\u5b9a\u5b58\u5728\u4e00\u4e2a\u6700\u5927\u7684 i\u6ee1\u8db3A[i\u22121]\u2264B[j]<\/code>\uff1b<\/li>
              • \u5982\u679c i\u662f\u6700\u5927\u7684\uff0c\u90a3\u4e48\u8bf4\u660e i+1 \u4e0d\u6ee1\u8db3\u3002\u5c06 i+1\u5e26\u5165\u53ef\u4ee5\u5f97\u5230 A[i]>B[j\u22121]<\/code>\uff0c\u4e5f\u5c31\u662fB[j\u22121]<A[i]<\/code>\uff0c\u5c31\u548c\u6211\u4eec\u8fdb\u884c\u7b49\u4ef7\u53d8\u6362\u524d i \u7684\u6027\u8d28\u4e00\u81f4\u4e86<\/li><\/ul>\n\n\n
                \u56e0\u6b64\u6211\u4eec\u53ef\u4ee5\u5bf9 i \u5728 [0, m] \u7684\u533a\u95f4\u4e0a\u8fdb\u884c\u4e8c\u5206\u641c\u7d22\uff0c\u627e\u5230\u6700\u5927\u7684\u6ee1\u8db3 A[i\u22121]\u2264B[j]<\/code> \u7684 i \u503c\uff0c\u5c31\u5f97\u5230\u4e86\u5212\u5206\u7684\u65b9\u6cd5\u3002\u6b64\u65f6\uff0c\u5212\u5206\u524d\u4e00\u90e8\u5206\u5143\u7d20\u4e2d\u7684\u6700\u5927\u503c\uff0c\u4ee5\u53ca\u5212\u5206\u540e\u4e00\u90e8\u5206\u5143\u7d20\u4e2d\u7684\u6700\u5c0f\u503c\uff0c\u624d\u53ef\u80fd\u4f5c\u4e3a\u5c31\u662f\u8fd9\u4e24\u4e2a\u6570\u7ec4\u7684\u4e2d\u4f4d\u6570\u3002<\/p>\n\n\n
                \u6ce8\uff1a\u53d6\u81eaLeeCode\u5b98\u65b9\u89e3\u9898\u601d\u8def<\/p>\n\n\n
                \u200b
                \/\/4.\u5212\u5206\u6570\u7ec4
                \/\/\u65f6\u95f4\u590d\u6742\u5ea6: O(logmin(m,n))), \u7a7a\u95f4\u590d\u6742\u5ea6: O(1)
                public double findMedianSortedArrays(int[] A, int[] B) {
                    \/\/\u4fdd\u8bc1lenA < lenB
                    if (A.length > B.length) {
                        return findMedianSortedArrays(B, A);
                    }
                \u200b
                    int m = A.length;
                    int n = B.length;
                    int left = 0, right = m;
                    \/\/ medianFront\uff1a\u524d\u4e00\u90e8\u5206\u7684\u6700\u5927\u503c
                    \/\/ medianBack\uff1a\u540e\u4e00\u90e8\u5206\u7684\u6700\u5c0f\u503c
                    int medianFront = 0, medianBack = 0;
                \u200b
                    while (left <= right) {
                        \/\/ \u524d\u4e00\u90e8\u5206\u5305\u542b A[0 .. i-1] \u548c B[0 .. j-1]
                        \/\/ \u540e\u4e00\u90e8\u5206\u5305\u542b A[i .. m-1] \u548c B[j .. n-1]
                        int i = (left + right) \/ 2;
                        int j = (m + n + 1) \/ 2 - i;
                \u200b
                        \/\/A_i_1 \u8868\u793a A[i-1]
                        int A_i_1 = (i == 0 ? Integer.MIN_VALUE : A[i - 1]);
                        \/\/A_i \u8868\u793a A[i]
                        int A_i = (i == m ? Integer.MAX_VALUE : A[i]);
                        \/\/B_j_1 \u8868\u793a B[j-1]
                        int B_j_1 = (j == 0 ? Integer.MIN_VALUE : B[j - 1]);
                        \/\/B_j \u8868\u793a B[j]
                        int B_j = (j == n ? Integer.MAX_VALUE : B[j]);
                \u200b
                        \/\/A[i-1] <= B[j]
                        if (A_i_1 <= B_j) {
                            medianFront = Math.max(A_i_1, B_j_1);\/\/\u53d6\u524d\u534a\u90e8\u5206\u7684\u6700\u5927\u503c
                            medianBack = Math.min(A_i, B_j);\/\/\u53d6\u540e\u534a\u90e8\u5206\u7684\u6700\u5c0f\u503c
                            left = i + 1;\/\/\u5254\u9664A[left,...,i]\u7684\u90e8\u5206\uff0ci\u53bb\u53d6A[left+1,...,right]
                        }else{
                            right = i - 1;\/\/\u5254\u9664A[i,...,right]\u7684\u90e8\u5206\uff0ci\u53bb\u53d6A[left,...,i-1]
                        }
                    }
                \u200b
                    return (m + n) % 2 == 0 ? (medianFront + medianBack) \/ 2.0 : medianFront;
                }<\/pre>\n","protected":false},"excerpt":{"rendered":"
                \u7ed9\u5b9a\u4e24\u4e2a\u5927\u5c0f\u5206\u522b\u4e3am\u548cn\u7684\u6b63\u5e8f(\u4ece\u5c0f\u5230\u5927)\u6570\u7ec4nums1\u548cnums2\u3002\u8bf7\u4f60\u627e\u51fa\u5e76\u8fd4\u56de\u8fd9\u4e24\u4e2a\u6b63\u5e8f\u6570\u7ec4\u7684\u4e2d\u4f4d\u6570\u3002  […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3],"tags":[],"class_list":["post-186","post","type-post","status-publish","format-standard","hentry","category-leecode"],"_links":{"self":[{"href":"http:\/\/www.huerpu.cc:7000\/index.php?rest_route=\/wp\/v2\/posts\/186","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/www.huerpu.cc:7000\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/www.huerpu.cc:7000\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/www.huerpu.cc:7000\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.huerpu.cc:7000\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=186"}],"version-history":[{"count":0,"href":"http:\/\/www.huerpu.cc:7000\/index.php?rest_route=\/wp\/v2\/posts\/186\/revisions"}],"wp:attachment":[{"href":"http:\/\/www.huerpu.cc:7000\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=186"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/www.huerpu.cc:7000\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=186"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/www.huerpu.cc:7000\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=186"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}