{"id":471,"date":"2019-03-08T21:18:23","date_gmt":"2019-03-08T13:18:23","guid":{"rendered":"https:\/\/kaispace.cn\/?p=471"},"modified":"2019-03-08T21:18:23","modified_gmt":"2019-03-08T13:18:23","slug":"20190303%e5%a4%b4%e6%9d%a1%e5%90%8e%e5%8f%b0%e4%b8%80%e9%9d%a2","status":"publish","type":"post","link":"https:\/\/blog.kaispace.cn\/?p=471","title":{"rendered":"20190303\u5934\u6761\u540e\u53f0\u4e00\u9762"},"content":{"rendered":"

\u4eca\u5929\u8fdb\u884c\u4e86\u4eba\u751f\u4e2d\u7684\u7b2c\u4e00\u6b21\u9762\u8bd5\uff0c\u5c31\u9047\u5230\u4e86\u5730\u72f1\u96be\u5ea6\u7684\u5934\u6761\u540e\u7aef\uff0c\u9762\u5b8c\u81ea\u6211\u611f\u89c9\u8d85\u7ea7\u5dee\uff0c\u4f46\u662f\u8fd8\u662f\u8fc7\u4e86\uff0c
\n\u9762\u5b8c\u628a\u4e24\u9053\u95ee\u9898\u91cd\u65b0\u89e3\u51b3\u4e86\u4e00\u4e0b\uff0c\u505a\u505a\u7ecf\u9a8c\u603b\u7ed3\u5427,\u6bd5\u7adf\u9762\u8bd5\u65e0\u8bba\u7ed3\u679c\u90fd\u662f\u5bf9\u81ea\u5df1\u4e00\u6b21\u5f88\u597d\u7684\u67e5\u6f0f\u8865\u7f3a~<\/p>\n

\u7b2c\u4e00\u9053 \u7ecf\u5178\u5230\u4e0d\u80fd\u518d\u7ecf\u5178\u7684 TOPK<\/h1>\n

TOPK \u6bd4\u8f83\u66b4\u529b\u7684\u65b9\u6cd5\u5c31\u4e0d\u5199\u4e86
\n\u4e3b\u8981\u6211\u8bf4\u4e86\u4e24\u79cd\u65b9\u6cd5\uff0c\u4e00\u79cd\u662f\u5229\u7528\u5806\u6392\u5e8f\uff0c\u5efa\u7acb\u4e00\u4e2a\u5927\u5c0f\u4e3ak\u7684\u5c0f\u9876\u5806\uff0c\u4ee5\u53ca\u4e00\u4e2alength-k\u7684\u5927\u9876\u5806\uff0c\u7136\u540e\u5faa\u73af\u53d6\u51fa\u5927\u9876\u5806\u7684\u5806\u5934\u4e0e\u5c0f\u9876\u5806\u7684\u5806\u5934\u6bd4\u8f83\uff0c
\n\u5982\u679c\u6bd4\u5c0f\u9876\u5806\u7684\u5806\u5934\u5927\uff0c\u5219\u8986\u76d6\u5c0f\u9876\u5806\u5806\u5934\uff0c\u7136\u540e\u518d\u628a\u4e24\u4e2a\u5806\u8fdb\u884csiftdown\u76f4\u5230\u5927\u9876\u5806\u904d\u5386\u5b8c\u3002\u6b64\u65f6\u7684\u5c0f\u9876\u5806\u5806\u5934\u5c31\u662fTOPK\uff0c\u6574\u4e2a\u5c0f\u9876\u5806\u5c31\u662f\u524dK\u5927\u3002<\/p>\n

\u5806\u6392\u601d\u60f3<\/h3>\n
private static int getTopKByHeap(int[] input,int k){\n    \/\/\u83b7\u5f97\u6700\u5c0f\u5806\n    int len = input.length;\n    \/\/\u590d\u5236\u5907\u4efd\u8fdb\u65b0\u6570\u7ec4 \u5c0f\u9876\u5806\n    \/\/\u5f53\u7136\u4f60\u53ef\u4ee5\u4e0d\u7528\u590d\u5236\u6cbf\u7528\u65e7\u6570\u7ec4\uff0c\n    \/\/\u53ea\u662f\u5728\u53bb\u9664\u65f6\u5c31\u8981\u5224\u65ad\u5806\u9876\u7684\u4f4d\u7f6e\u662f\u5728\u54ea\u91cc\n    int [] newInput = new int[k];\n    for(int i = 0;i<k;i++){\n        newInput[i] = input[i];\n    }\n    \/\/\u590d\u5236\u5907\u4efd\u8fdb\u65b0\u6570\u7ec4 \u5927\u9876\u5806\n    int [] newInput2 = new int[len-k];\n    for(int i = 0;i<len-k;i++){\n        newInput2[i] = input[i+k];\n    }\n    \/\/\u5c0f\u9876\u5806\u521d\u59cb\u5316\n    heapify(newInput,0,k-1,false);\n    \/\/\u5927\u9876\u5806\u521d\u59cb\u5316\n    heapify(newInput2,k,len-1,true);\n    \/\/\u904d\u5386\u5927\u9876\u5806 \u8fdb\u884c\u6bd4\u8f83\n    for(int i = 0;i<len-k;i++){\n        int temp = take(newInput2,true);\n        if(newInput[0]<temp){\n            newInput[0] = temp;\n            siftDown(newInput,0,temp,false);\n        }\n    }\n    \/\/\u8fd4\u56de\u5c0f\u9876\u5806\u5934\n    return newInput[0];\n}\n\nprivate static void heapify(int [] input,int beginIndex,int endIndex,boolean isBigHeap){\n    \/\/(endIndex-beginIndex+1>>>1)-1\u5c31\u662f\u62ff\u51fa\u6240\u6709\u975e\u53f6\u8282\u70b9\u7684\u7d22\u5f15\u8fdb\u884csiftDown\n    for(int i = ((endIndex-beginIndex+1)>>>1)-1;i>=0;i--){\n        siftDown(input,i,input[i],isBigHeap);\n    }\n}\n\n\/\/\u5176\u5b9e\u5806\u6392\u6211\u662f\u5b66\u4e60\u4e86\u4f18\u5148\u7ea7\u961f\u5217\u7684\u6e90\u7801\u5b9e\u73b0\u7684\nprivate static void siftDown(int [] input,int i,int e,boolean isBigHeap) {\n    int len = input.length;\n    int half = len >> 1;\n    while (i < half) {\n        \/\/\u627e\u51fa\u5de6\u5b50\u8282\u70b9\u7684\u7d22\u5f15\n        int child = (i << 1) + 1;\n        \/\/\u627e\u51fa\u53f3\u5b50\u8282\u70b9\u7684\u7d22\u5f15\n        int right = child + 1;\n        \/\/\u5c0f\u9876\u5806\u5927\u9876\u5806\u4e0d\u540c\u6761\u4ef6\n        if (isBigHeap) {\n            \/\/\u5927\u9876\u5806\u662f\u8981\u627e\u51fa\u5b50\u8282\u70b9\u7684\u6700\u5927\u503c\uff0c\u5c06\u5176\u7d22\u5f15\u8d4b\u4e88child\n            if (right < len && input[child] < input[right]) {\n                child = right;\n            }\n            \/\/\u9047\u5230\u6700\u5927\u5b50\u8282\u70b9\u90fd\u6bd4\u81ea\u5df1\u5c0f\u7684\uff0c\u5c31\u53ef\u4ee5\u505c\u6b62\u4e0b\u6c89\u4e86\n            if (e > input[child]) {\n                break;\n            }\n        } else {\n            \/\/\u4e0e\u5927\u9876\u5806\u76f8\u53cd\uff0c\u627e\u6700\u5c0f\u5b50\u8282\u70b9\n            if (right < len && input[child] > input[right]) {\n                child = right;\n            }\n            \/\/\u5b50\u8282\u70b9\u90fd\u6bd4\u8f83\u81ea\u5df1\u5927\uff0c\u5219\u505c\u6b62\u4e0b\u6c89\n            if (e < input[child]) {\n                break;\n            }\n        }\n        \/\/\u628a\u6ee1\u8db3\u6761\u4ef6\u7684\u5b50\u8282\u70b9\u548c\u5f53\u524d\u8282\u70b9\u4ea4\u6362\u4f4d\u7f6e\uff0c\u5f53\u524d\u8282\u70b9\u4e0b\u6c89\n        input[i] = input[child];\n        i = child;\n    }\n    \/\/\u5230\u8fbe\u53f6 \u505c\u6b62 \u8d4b\u503c\n    input[i] = e;\n}\n\nprivate static int take(int[] input,boolean isBigHeap){\n    \/\/\u5c0f\u9876\u5806 \u586b\u5145\u6700\u5927\u503c \u4f18\u5148\u7ea7\u961f\u5217\u6e90\u7801\u662fsize\u51cf\u5c0f\uff0c\u586b\u5145null\n    int replaceNum = Integer.MAX_VALUE;\n    if(isBigHeap)\n    {\n        \/\/\u5927\u9876\u5806 \u586b\u5145\u6700\u5c0f\u503c\n        replaceNum = Integer.MIN_VALUE;\n    }\n    \/\/\u53bb\u9664\u5806\u5934\n    int result = input[0];\n    \/\/\u628a\u6700\u5c3e\u90e8\u62ff\u5230\u6700\u524d\u8fdb\u884c\u4e00\u6b21\u4e0b\u5c42\n    input[0] = input[input.length-1];\n    \/\/\u586b\u5145\u5360\u4f4d\u503c\n    input[input.length-1] = replaceNum;\n    \/\/\u4e0b\u6c89\n    siftDown(input,0,input[0],isBigHeap);\n    return result;\n}\n<\/code><\/pre>\n
\u5feb\u6392\u601d\u60f3<\/h3>\n
\/\/\u5feb\u6392\u5b9e\u73b0\nprivate static int quickSort(int begin,int end,int [] input,int k){\n    if(begin>=end){\n        return -1;\n    }\n    int mid = (begin+end)>>>1;\n    int midValue = input[mid];\n    \/\/Part\u7684\u9009\u62e9\u7528\u4e86\u4e00\u4e2a\u4f18\u5316\u9632\u6b62\u5feb\u6392\u9000\u5316\u6210O(N^2),\u53d6\u5934\u5c3e\u4e2d\u95f4\u6570\u7136\u540e\u62ff\u4e2d\u4f4d\u6570\n    int part = getMidNum(input[begin],input[end],midValue);\n    int partIndex = part == input[begin] ? begin : part == input[end] ? end : mid;\n    swapNum(input,partIndex,begin);\n    int i = begin;\n    int j = end;\n    while(i!=j){\n        while (i<j && input[j]>=part){\n            j--;\n        }\n        while(i<j && input[i]<=part){\n            i++;\n        }\n        if(i<j){\n            int temp = input[i];\n            input[i] = input[j];\n            input[j] = temp;\n        }\n    }\n    input[partIndex]=input[j];\n    input[j] = part;\n    \/\/\u548c\u5e38\u89c4\u4e0d\u540c\u7684\u8df3\u51fa\u70b9 \u5c31\u662fj\u7684\u53f3\u8fb9\u521a\u521a\u597d\u662fk-1\u4e2a\u6570\n    if(input.length==j+k){\n        return input[j];\n    }\n\n    int result1 = quickSort(begin,j-1,input,k);\n    int result2 = quickSort(j+1,end,input,k);\n    return result1 == -1?result2:result1;\n}\n\nstatic int getMidNum(int a,int b,int c)\/\/\u4f18\u53161\uff1a\u4e09\u6570\u53d6\u4e2d\u6cd5\n{\n    if(a>b){\n        if(a>c){\n            if(b>c){\n                return b;\n            }else{\n                return c;\n            }\n        }else{\n            return a;\n        }\n    }else{\n        if(b>c){\n            if(a>c){\n                return a;\n            }else{\n                return c;\n            }\n        }else{\n            return b;\n        }\n    }\n}\n\nstatic void swapNum(int[] input,int i,int j){\n    int temp = input[i];\n    input[i] = input[j];\n    input[j] = temp;\n}\n<\/code><\/pre>\n
\u7b2c\u4e8c\u9898 \u7edf\u8ba11~10^5\u5185\u6709\u591a\u5c11\u4e2a1(o(N)\u5b9e\u73b0)<\/h1>\n
\u5176\u5b9e\u4e00\u5f00\u59cb\u6211\u7684\u601d\u8def\u5c31\u5bf9\u5251\u6307offer\u4e00\u9053\u9898\u5148\u5165\u4e3a\u4e3b\u4e86\uff0c\u5176\u5b9e\u5f88\u7b80\u5355\uff0c\u9762\u8bd5\u5b98\u7ed9\u51fa\u4e86\u516c\u5f0f\u6211\u7531\u4e8e\u592a\u7d27\u5f20
\n\u81ea\u6211\u5426\u5b9a\u4e5f\u6ca1\u5199\u51fa\u6765\uff0c\u540e\u9762\u60f3\u4e86\u4e00\u4e0b\u65e0\u975e\u5c31\u662f\u5206\u5947\u5076\u7136\u540e\u91c7\u7528DP\u4f18\u5316\u3002<\/p>\n
\u5047\u8bbei=\u5076\u6570\uff0c\u90a3\u4e48\u4ed6\u76841\u7684\u4e2a\u6570\u4f1a\u7b49\u4e8ei>>>1\u91cc\u9762\u4e8c\u8fdb\u52361\u7684\u4e2a\u6570\uff0c(\u59824\u7684\u4e8c\u8fdb\u5236\u662f100,2\u7684\u4e8c\u8fdb\u5236\u662f010),
\n\u56e0\u6b64\u53ef\u4ee5\u77e5\u9053num[i]=num[i\/2];<\/p>\n
\u5047\u8bbei=\u5947\u6570\uff0c\u90a3\u4e48\u4ed6\u76841\u7684\u4e2a\u6570\u4f1a\u7b49\u4e8ei>>>1\u91cc\u9762\u7684\u4e8c\u8fdb\u5236\u7684\u4e2a\u6570\u518d\u52a01\uff0c(\u59825\u7684\u4e8c\u8fdb\u5236\u662f101,2\u7684\u4e8c\u8fdb\u5236\u662f010),\u5176\u5b9e\u5c31\u662f\u53f3\u79fb\u628a\u6700\u4f4e\u4f4d\u76841\u7ed9\u79fb\u52a8\u6ca1\u4e86\u518d\u8865\u4e0a\u3002<\/p>\n
\u6240\u4ee5\u5f97\u51fa\u516c\u5f0f\u5c31\u53ef\u4ee5\u5199\u51fa<\/p>\n
\/\/num[i*2] = num[i] i*2\u5c31\u4e00\u5b9a\u662f\u4e00\u4e2a\u5076\u6570\uff0c\u90a3\u4e48\u4ed6\u4ec5\u4ec5\u5c31\u53ea\u662fi\u7684\u4e8c\u8fdb\u5236\u5de6\u79fb\uff0c\u6240\u4ee51\u7684\u4e2a\u6570\u7684\u4e00\u6837\u7684\n\/\/num[i*2+1] = num[i]+1 i*2+1\u5c31\u4e00\u5b9a\u662f\u4e00\u4e2a\u5947\u6570\uff0c\u90a3\u4e48\u56e0\u4e3a\u53ef\u4ee5\u770b\u51fai\u7684\u4e8c\u8fdb\u5236\u5de6\u79fb\u518d\u52a0\u4e00\uff0c\u6240\u4ee51\u7684\u4e2a\u6570\u662fnum[i]+1\nint k = 100000;\nint [] a = new int[k+1];\nint ans = 0;\nfor(int i = 1;i<=k;i++){\n    \/\/\u6240\u4ee5\u7528i%2\u4e5f\u53ef\u4ee5\n    \/\/i&1\u4e5f\u662f\u5728\u5224\u5947\u5076\n    a[i] = a[i\/2]+(i&1);\/\/i&1 \u5982\u679ci\u662f\u5947\u6570\uff0c\u90a3\u4e48\u5c31\u52a01\uff0c\u5982\u679ci\u662f\u5076\u6570\uff0c\u90a3\u4e48\u5c31\u4e0d\u52a0\n    ans += a[i];\n}\n<\/code><\/pre>\n
\u671f\u95f4\u8ddf\u9762\u8bd5\u5b98\u8fd8\u8c08\u5230\u4e86\u7edf\u8ba110\u8fdb\u5236\u4e0b\u76841\u4e2a\u6570<\/p>\n
int ones = 0;\nfor (int m = 1; m <= n; m *= 10) {\n    int a = (int)n\/m, b = n%m;\n    ones += (a + 8) \/ 10 * m + (a % 10 == 1? 1 : 0) * (b + 1);\n    \/\/ +8\u5c31\u662f\u4e3a\u4e86\u966410\u7684\u65f6\u5019+1,\u56e0\u4e3a\u7b97\u4e0a0~n\u4e00\u5171\u6709n+1\u4e2a\u6570\uff0c\u4f46\u662f1\u662f\u9700\u8981\u7279\u6b8a\u8ba1\u7b97\u7684\uff0c\u52a08\n    \/\/ \u7279\u6b8a\u8ba1\u7b97\u90e8\u5206\u5c31\u662f\u5982 11000 \u5230 11999 \u671f\u95f4 \u8fd9999+1\u4e2a\u6570\u90fd\u8981\u52a0\u4e0a\u53bb \u56e0\u4e3a \u5343\u4f4d\u6570\u7684 1\n}\nreturn ones;\n<\/code><\/pre>\n
\u4ee5\u4e0b\u4e3a\u89e3\u51b3\u65b9\u6cd5
\n\u94fe\u63a5\uff1ahttps:\/\/www.nowcoder.com\/questionTerminal\/bd7f978302044eee894445e244c7eee6<\/p>\n
\u6211\u753b\u5f20\u8868\u5982\u4e0b\uff1a<\/p>\n
\u5f53n = 3141592\u65f6:<\/p>\n\n\n\n\n\n\n\n\n
m<\/th>\na<\/th>\nb<\/th>\nones<\/th>\n<\/tr>\n<\/thead>\n
1<\/td>\n3141592<\/td>\n0<\/td>\n(3141592+8)\/10*1+0=314160<\/td>\n<\/tr>\n
10<\/td>\n314159<\/td>\n2<\/td>\n(314159+8)\/10*10+0=314160<\/td>\n<\/tr>\n
100<\/td>\n31415<\/td>\n92<\/td>\n(31415+8)\/10*100+0=314200<\/td>\n<\/tr>\n
1000<\/td>\n3141<\/td>\n592<\/td>\n(3141+8)\/101000+1(592+1)=314593<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
\u5f53\u7136\u540e\u9762\u8fd8\u6709m=10000,100000,1000000\u4e09\u79cd\u60c5\u51b5\uff0c\u5bf9\u5e94\u7740\u4e07\u4f4d\uff0c\u5341\u4e07\u4f4d\uff0c \u767e\u4e07\u4f4d\u4e3a1\u65f6\u7684\u60c5\u51b5<\/p>\n
\u4e0b\u9762\u8bf4\u4e0ba+8\u7684\u610f\u4e49\uff1a<\/p>\n
\u5f53\u8003\u8651\u4e2a\u4f4d\uff0c\u5341\u4f4d\uff0c\u767e\u4f4d\u8fd9\u4e09\u4f4d\u4e3a1\u7684\u60c5\u51b5\u65f6\uff1a<\/p>\n
\u4e2a\u4f4d 2 \uff0c\u5f53\u4e2a\u4f4d\u53d6\u503c1\u65f6\uff0c\u524d\u9762\u7684\u516d\u4f4d\u6570\u5b57\u53ef\u75310~314159\u7ec4\u6210\uff0c\u5373314160\u79cd\u60c5\u51b5<\/p>\n
\u5341\u4f4d9\uff0c\u5f53\u5341\u4f4d\u53d6\u503c1\u65f6\uff0c\u524d\u9762\u7684\u4e94\u4f4d\u6570\u5b57\u53ef\u75310\\~31415\u7ec4\u6210\uff0c\u5341\u4f4d\u4e4b\u540e\u7684\u4e00\u4f4d\u53ef\u75310~9\u7ec4\u6210\uff0c\u7ec4\u5408\u60c5\u51b531416*10=314160\u79cd\u60c5\u51b5<\/p>\n
\u767e\u4f4d5\uff0c\u5f53\u767e\u4f4d\u53d6\u503c\u4e3a1\u65f6\uff0c\u524d\u9762\u7684\u56db\u4f4d\u6570\u5b57\u53ef\u75310\\~3141\u7ec4\u6210\uff0c\u767e\u4f4d\u4e4b\u540e\u7684\u4e24\u4f4d\u53ef\u75310~99\u7ec4\u6210\uff0c\u7ec4\u5408\u60c5\u51b5\u4e3a3142*100=314200\u79cd\u60c5\u51b5<\/p>\n
\u6ce8\u610f\uff1a\u5f53\u8003\u8651\u5343\u4f4d1\u65f6\uff1a<\/p>\n
\u5343\u4f4d1\uff0c\u5343\u4f4d\u53d6\u503c\u53731\uff0c\u524d\u9762\u7684\u4e09\u4f4d\u6570\u5b57\u53ef\u75310\\~314\u7ec4\u6210\uff0c\u4f46\u662f\u5f53\u524d\u9762\u7684\u503c\u4e3a314\u65f6\uff0c\u540e\u9762\u7684\u4e09\u4f4d\u53ea\u67090\\~592\u79cd\u60c5\u51b5(\u7279\u6b8a\u60c5\u51b5)\uff0c\u5176\u4f59\u7684\u60c5\u51b5\u5373\u4e3a\u524d\u9762\u7684\u503c\u4e3a0\\~313,\u540e\u9762\u4e09\u4f4d\u67090\\~999,\u60c5\u51b5\u6570\u4e3a3141000\uff0c\u6240\u4ee5\u603b\u60c5\u51b5\u6570\u4e3a3141000 + 593=314593\u79cd\u60c5\u51b5<\/p>\n
\u8fd9\u65f6\u53ef\u53d1\u73b0\u548c\u4ee3\u7801\u4e2d\u7684\u516c\u5f0f\u7b97\u7684\u60c5\u51b5\u662f\u543b\u5408\u7684\uff0ca+8\u7684\u5de7\u5999\u4e4b\u5904\u5728\u4e8e\u5f53a\u7684\u6700\u540e\u4e00\u4f4d(\u5f53\u524d\u5206\u6790\u4f4d)\u4e3a0\u62161\u65f6\uff0c\u52a08\u4e0d\u4ea7\u751f\u8fdb\u4f4d\uff0c\u8fd9\u662f\u4e3a\u9700\u8981\u5355\u72ec\u7b97\u7684\u7279\u6b8a\u60c5\u51b5\u505a\u51c6\u5907\uff0c\u800c\u5f53\u524d\u5206\u6790\u4f4d\u4e3a2~9\u65f6\uff0c\u4e0d\u9700\u8981\u8003\u8651\u7279\u6b8a\u60c5\u51b5\uff0c\u6240\u4ee5\u5141\u8bb8\u52a08\u4ea7\u751f\u7684\u8fdb\u4f4d\u3002<\/p>\n","protected":false},"excerpt":{"rendered":"
\u4eca\u5929\u8fdb\u884c\u4e86\u4eba\u751f\u4e2d\u7684\u7b2c\u4e00\u6b21\u9762\u8bd5\uff0c\u5c31\u9047\u5230\u4e86\u5730\u72f1\u96be\u5ea6\u7684\u5934\u6761\u540e\u7aef\uff0c\u9762\u5b8c\u81ea\u6211\u611f\u89c9\u8d85\u7ea7\u5dee\uff0c\u4f46\u662f\u8fd8\u662f\u8fc7\u4e86\uff0c \u9762\u5b8c\u628a\u4e24\u9053\u95ee\u9898\u91cd…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[18],"tags":[],"_links":{"self":[{"href":"https:\/\/blog.kaispace.cn\/index.php?rest_route=\/wp\/v2\/posts\/471"}],"collection":[{"href":"https:\/\/blog.kaispace.cn\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.kaispace.cn\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.kaispace.cn\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.kaispace.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=471"}],"version-history":[{"count":0,"href":"https:\/\/blog.kaispace.cn\/index.php?rest_route=\/wp\/v2\/posts\/471\/revisions"}],"wp:attachment":[{"href":"https:\/\/blog.kaispace.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=471"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.kaispace.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=471"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.kaispace.cn\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=471"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}