{"id":3626,"date":"2019-07-08T20:41:01","date_gmt":"2019-07-08T12:41:01","guid":{"rendered":"https:\/\/damogame.cn\/wordpress\/?p=3626"},"modified":"2019-07-08T20:41:01","modified_gmt":"2019-07-08T12:41:01","slug":"%e6%95%b0%e6%8d%ae%e7%bb%93%e6%9e%84%e5%ad%a6%e4%b9%a0%e7%ac%94%e8%ae%b0%ef%bc%88%e4%b9%9d%ef%bc%89%e8%b7%b3%e8%a1%a8%e3%80%81%e5%ad%97%e5%85%b8%e7%9a%84%e8%b7%b3%e8%a1%a8%e6%8f%8f%e8%bf%b0","status":"publish","type":"post","link":"https:\/\/i007.cc\/wordpress\/archives\/3626","title":{"rendered":"\u6570\u636e\u7ed3\u6784\u5b66\u4e60\u7b14\u8bb0\uff08\u4e5d\uff09\u8df3\u8868\u3001\u5b57\u5178\u7684\u8df3\u8868\u63cf\u8ff0"},"content":{"rendered":"
\n
\n
\n

\u539f\u6587\u5730\u5740<\/a><\/p>\n

 <\/p>\n<\/div>\n

\n
2016\u5e7408\u670801\u65e5 16:56:02<\/span>\u00a0\u9f99\u4e4b\u56fd\u5ea6<\/a>\u00a0\u9605\u8bfb\u6570 795<\/span><\/div>\n
<\/div>\n<\/div>\n<\/div>\n<\/div>\n
\n
\n
\u00a0\u7248\u6743\u58f0\u660e\uff1a\u968f\u4fbf\u8f6c\u8f7d\uff0c\u968f\u4fbf\u770b https:\/\/blog.csdn.net\/baidu_35573762\/article\/details\/52087152<\/div>\n
\n
\u4e00\u3001\u8df3\u8868<\/h5>\n

\u5728\u4f7f\u7528\u6709\u5e8f\u94fe\u8868\u63cf\u8ff0\u7684n\u4e2a\u6570\u5bf9\u7684\u5b57\u5178\u4e2d\u8fdb\u884c\u67e5\u627e\uff0c\u81f3\u591a\u9700\u8981n\u8bcd\u6bd4\u8f83\u3002\u5982\u679c\u4f7f\u7528\u6298\u534a\u67e5\u627e\u7684\u601d\u60f3\uff0c\u4f7f\u7528\u8df3\u8868\u6765\u63cf\u8ff0\uff0c\u53ef\u4ee5\u5927\u5927\u52a0\u5feb\u641c\u7d22\u7684\u901f\u5ea6\u3002\u5728\u4e0b\u56fe10-1\u4e2d\uff0ca\u8868\u793a\u7684\u6709\u5e8f\u94fe\u8868\u67097\u4e2a\u6570\u5bf9\uff0c\u8be5\u94fe\u8868\u589e\u52a0\u4e00\u4e2a\u5934\u7ed3\u70b9\u548c\u4e00\u4e2a\u5c3e\u8282\u70b9\u3002\u5bf9\u8be5\u94fe\u8868\u8fdb\u884c\u641c\u7d22\u6700\u591a\u9700\u89817\u6b21\u5173\u952e\u5b57\u7684\u6bd4\u8f83\u3002\u5982\u679c\u50cfb\u90a3\u6837\uff0c\u5728\u4e2d\u95f4\u7684\u8282\u70b9\u4e2d\u52a0\u5165\u4e00\u4e2a\u6307\u9488\uff0c\u90a3\u4e48\u6bd4\u8f83\u65f6\u5148\u548c\u8fd9\u4e2a\u4e2d\u95f4\u8282\u70b9\u6bd4\u8f83\uff0c\u5728\u51b3\u5b9a\u5728\u524d\u534a\u90e8\u5206\u8fd8\u662f\u540e\u534a\u90e8\u5206\u7ee7\u7eed\u641c\u7d22\uff0c\u56e0\u6b64\u641c\u7d22\u6700\u591a\u9700\u89814\u6b21\u5173\u952e\u5b57\u7684\u6bd4\u8f83\u3002<\/p>\n

\u4e5f\u53ef\u4ee5\u50cfc\u90a3\u6837\uff0c\u5206\u522b\u5728\u5de6\u534a\u90e8\u5206\u548c\u540e\u534a\u90e8\u5206\u7684\u4e2d\u95f4\u8282\u70b9\u589e\u52a0\u4e00\u4e2a\u6307\u9488\uff0c\u4ee5\u8fdb\u4e00\u6b65\u51cf\u5c11\u6700\u574f\u60c5\u51b5\u4e0b\u7684\u6bd4\u8f83\u6b21\u6570\u3002\u8be5\u56fe\u6709\u4e09\u7ea7\u94fe\u8868\uff0c0\u7ea7\u94fe\u8868\u662f\u521d\u59cb\u94fe\u8868\uff0c\u5305\u542b7\u4e2a\u6570\u5bf9\uff0c1\u7ea7\u94fe\u8868\u5305\u542b\u5b57\u5178\u7684\u4e8c\u3001\u56db\u3001\u516d\u6570\u5bf9\uff0c2\u7ea7\u94fe\u8868\u53ea\u5305\u542b\u7b2c\u56db\u4e2a\u6570\u5bf9\u3002\u67e5\u627e\u65f6\uff0c\u5148\u6839\u636e2\u7ea7\u94fe\u8868\uff0c\u5224\u65ad\u63a5\u4e0b\u5728\u5de6\u534a\u90e8\u5206\u8fd8\u662f\u53f3\u534a\u90e8\u5206\u7ee7\u7eed\u67e5\u627e\uff0c\u7136\u540e\u6839\u636e1\u7ea7\u94fe\u8868\uff0c\u6700\u540e\u6839\u636e0\u7ea7\u94fe\u8868\u67e5\u627e\uff0c\u8fd9\u4e2a\u8fc7\u7a0b\u641c\u7d22\u65f6\u6700\u5feb\u60c5\u51b5\u53ea\u9700\u89813\u6b21\u6bd4\u8f83\u3002<\/p>\n

\u4e3e\u4e2a\u4f8b\u5b50\uff0c\u67e5\u627e\u5173\u952e\u5b57\u4e3a77\u7684\u6570\u5bf9\u3002\u9996\u5148\u548c2\u7ea7\u94fe\u8868\u7684\u8282\u70b940\u6bd4\u8f83\uff0c\u56e0\u4e3a77\u5927\uff0c\u6240\u4ee5\u63a5\u4e0b\u6765\u57281\u7ea7\u94fe\u8868\u4e2d\u548c\u8282\u70b975\u6bd4\u8f83\u3002\u56e0\u4e3a\u8fd8\u662f77\u5927\uff0c\u6240\u4ee5\u57280\u7ea7\u94fe\u8868\u4e2d\u4e0e75\u540e\u9762\u7684\u8282\u70b980\u6bd4\u8f83\uff0c\u6700\u540e\u5f97\u77e577\u4e0d\u5728\u5b57\u5178\u4e2d\u3002<\/p>\n

\"\"<\/p>\n

\u8bf8\u5982c\u7684\u7ed3\u6784\u79f0\u4e4b\u4e3a\u8df3\u8868\u3002\u5bf9\u4e8en\u4e2a\u6570\u5bf9\u800c\u8a00\uff0c0\u7ea7\u94fe\u8868\u5305\u542b\u6240\u6709\u6570\u5bf9\uff0c1\u7ea7\u94fe\u8868\u6bcf2\u4e2a\u6570\u5bf9\u53d6\u4e00\u4e2a\uff0c2\u7ea7\u94fe\u8868\u6bcf4\u4e2a\u6570\u5bf9\u53d6\u4e00\u4e2a\uff0ci\u7ea7\u94fe\u8868\u6bcf2^i\u4e2a\u6570\u5bf9\u53d6\u4e00\u4e2a\u3002\u4e00\u4e2a\u6570\u5bf9\u5c5e\u4e8ei\u7ea7\u94fe\u8868\uff0c\u5f53\u4e14\u4ec5\u5f53\u5b83\u5c5e\u4e8e0~i\u7ea7\u94fe\u8868\uff0c\u4f46\u4e0d\u5c5e\u4e8ei+1\u7ea7\u94fe\u8868\u3002\u5728\u56fec\u4e2d\uff0c\u5173\u952e\u5b57\u662f40\u7684\u6570\u5bf9\u5c5e\u4e8e2\u7ea7\u94fe\u8868\uff0c\u5173\u952e\u5b57\u4e3a24\u548c75 \u7684\u6570\u5bf9\u5c5e\u4e8e1\u7ea7\u94fe\u8868\uff0c\u5173\u952e\u5b57\u4e3a20\u300130\u300160\u300180\u7684\u6570\u5bf9\u5c5e\u4e8e0\u7ea7\u94fe\u8868\u3002<\/p>\n

\u4e8c\u3001\u8df3\u8868\u7684\u5b9e\u73b0\uff1a<\/h5>\n

\u63d2\u5165\u548c\u5220\u9664<\/p>\n

\u5728\u63d2\u5165\u548c\u5220\u9664\u65f6\uff0c\u8981\u4fdd\u6301\u50cf\u56fe\u4e2dc\u6240\u793a\u8df3\u8868\u7684\u89c4\u5219\u7ed3\u6784\uff0c\u9700\u8981\u8017\u65f6O(n)\u3002\u5728\u89c4\u5219\u7684\u8df3\u8868\u7ed3\u6784\u4e2d\uff0ci\u7ea7\u94fe\u8868\u6709n\/2^i\u4e2a\u8bb0\u5f55\uff0c\u5728\u63d2\u5165\u8981\u5c3d\u91cf\u903c\u8fd1\u8fd9\u79cd\u7ed3\u6784\u3002\u63d2\u5165\u7684\u65b0\u6570\u5bf9\u5c5e\u4e8ei\u7ea7\u94fe\u8868\u7684\u6982\u7387\u4e3a\u00a01 \/ 2^i\u3002\u5728\u5b9e\u9645\u786e\u5b9a\u65b0\u6811\u6240\u5c5e\u7684\u94fe\u8868\u7ea7\u522b\u65f6\uff0c\u5e94\u8003\u8651\u5404\u79cd\u53ef\u80fd\u7684\u60c5\u51b5\u3002\u628a\u65b0\u6570\u5bf9\u63d2\u5165i\u7ea7\u94fe\u8868\u7684\u53ef\u80fd\u6027\u4e3ap^i\u3002\u5728\u56fec\u4e2d\uff0cp=0.5\u3002\u5728\u4e00\u4e2a\u89c4\u5219\u7684\u8df3\u8868\u4e2d\uff0ci\u7ea7\u94fe\u8868\u5305\u542b1\/p\u4e2ai-1\u7ea7\u94fe\u8868\u7684\u8282\u70b9\u3002<\/p>\n

\u5047\u8bbe\u9700\u8981\u63d2\u5165\u5173\u952e\u5b57\u4e3a77\u7684\u6570\u5bf9\u3002\u9996\u5148\u901a\u8fc7\u641c\u7d22\u786e\u5b9a\u94fe\u8868\u4e2d\u6ca1\u6709\u8be5\u5143\u7d20\u3002\u5728\u641c\u7d22\u65f6\uff0c\u6211\u4eec\u7528\u5230\u4e86\u5173\u952e\u5b57\u4e3a40 \u7684\u8282\u70b9\uff082\u7ea7\u94fe\u8868\u6307\u9488\uff09\u3001\u5173\u952e\u5b57\u4e3a75 \u7684\u8282\u70b9\uff081\u7ea7\u94fe\u8868\u6307\u9488\uff09\u548c\u4e00\u4e2a0\u7ea7\u94fe\u8868\u6307\u9488\u3002\u56fed\u4e2d\u3002\u8fd9\u51e0\u4e2a\u6307\u9488\u88ab\u4e00\u6761\u865a\u7ebf\u5207\u5272\u3002\u65b0\u6570\u5bf9\u63d2\u5165\u7684\u4f4d\u7f6e\u572875\u548c80\u4e4b\u95f4\u3002 \u00a0 \u00a0\u786e\u5b9a\u4f4d\u7f6e\u540e\uff0c\u8fd8\u8981\u4e3a\u65b0\u6570\u5bf9\u5206\u914d\u4e00\u4e2a\u7ea7\uff08\u5373\u786e\u5b9a\u4ed6\u5c5e\u4e8e\u54ea\u4e00\u7ea7\u94fe\u8868\uff09\u3002\u82e5\u65b0\u6570\u5bf9\u5c5e\u4e8ei\u7ea7\u94fe\u8868\uff0c\u5219\u63d2\u5165\u7ed3\u679c\u4ec5\u5f71\u54cd\u6709\u865a\u7ebf\u5207\u5272\u76840~i\u7ea7\u94fe\u8868\u7684\u6307\u9488\u3002\u56fee\u662f\u63d2\u5165\u7ed3\u679c\u3002<\/p>\n

\u5220\u9664\u64cd\u4f5c\uff0c\u6211\u4eec\u65e0\u6cd5\u63a7\u5236\u7ed3\u6784\u3002\u8981\u5220\u9664\u56fee\u7684\u8282\u70b977\uff0c\u9996\u5148\u8981\u627e\u523077\u3002\u56e0\u4e3a77\u4e3a1\u7ea7\u94fe\u8868\u4e2d\u6570\u5bf9\u7684\u5173\u952e\u5b57\uff0c\u6240\u4ee5\u53ea\u9700\u8981\u6539\u53d80\u7ea7\u548c1\u7ea7\u94fe\u8868\u6307\u9488\u5373\u53ef\u3002\u5f53\u8fd9\u4e9b\u6307\u9488\u6307\u541177\u540e\u9762\u7684\u8282\u70b9\u65f6\uff0c\u5c31\u5f97\u5230\u56fed\u7684\u7ed3\u6784\u3002<\/p>\n

\u7ea7\u6570\u7684\u5206\u914d<\/p>\n

\u6211\u4eec\u77e5\u9053\u5728\u89c4\u5219\u7684\u8df3\u8868\u7ed3\u6784\u4e2d\uff0ci-1\u7ea7\u94fe\u8868\u7684\u6570\u5bf9\u4e2a\u6570\u4e0ei\u7ea7\u94fe\u8868\u7684\u6570\u5bf9\u4e2a\u6570\u4e4b\u6bd4\u662f\u4e00\u4e2a\u5206\u6570p\u3002\u56e0\u6b64\u5c5e\u4e8ei-1\u7ea7\u94fe\u8868\u7684\u6570\u5bf9\u540c\u65f6\u5c5e\u4e8ei\u7ea7\u94fe\u8868\u7684\u6982\u7387\u662fp\u3002\u5047\u8bbe\u7528\u4e00\u4e2a\u7edf\u4e00\u7684\u968f\u673a\u6570\u751f\u6210\u5668\u4ea7\u751f0~1\u4e4b\u95f4\u7684\u5b9e\u6570\uff0c\u4ea7\u751f\u7684\u968f\u673a\u6570<=p\u7684\u6982\u7387\u662fp\u3002\u82e5\u4e0b\u4e00\u4e2a\u968f\u673a\u6570<=p\uff0c\u5219\u65b0\u6570\u5bf9\u5e94\u57281\u7ea7\u94fe\u8868\u4e0a\u3002\u8981\u786e\u5b9a\u8be5\u6570\u5bf9\u662f\u5426\u57282\u7ea7\u94fe\u8868\u4e0a\uff0c\u8981\u7531\u4e0b\u4e00\u4e2a\u968f\u673a\u6570\u786e\u5b9a\u3002\u82e5\u65b0\u7684\u968f\u673a\u6570<=p\uff0c\u5219\u8be5\u5143\u7d20\u4e5f\u5c5e\u4e8e2\u7ea7\u94fe\u8868\uff0c\u91cd\u590d\u8be5\u8fc7\u7a0b\u77e5\u9053\u968f\u673a\u6570>p\u4e3a\u6b62\u3002<\/p>\n

\u8fd9\u79cd\u65b9\u5f0f\u5206\u914d\u7684\u7ea7\u6570\u53ef\u80fd\u7279\u522b\u5927\uff0c\u4e3a\u6b64\u8bbe\u5b9a\u4e00\u4e2a\u7ea7\u6570\u7684\u4e0a\u9650maxLevel\uff0c\u6700\u5927\u503c\u4e3a\uff08\u89c1\u4e0b\u56fe\uff09\u3002\u6b64\u5916\uff0c\u8fd9\u79cd\u65b9\u5f0f\u8fd8\u6709\u4e00\u4e2a\u7f3a\u70b9\uff1a\u5f53\u63d2\u5165\u4e00\u4e2a\u65b0\u6570\u5bf9\u4e4b\u524d\u67093\u4e2a\u94fe\u8868\uff0c\u800c\u5728\u63d2\u5165\u4e4b\u540e\u5c31\u6709\u53ef\u80fd\u670910\u4e2a\u94fe\u8868\uff0c\u4e5f\u5c31\u662f\u8bf43~8\u7ea7\u94fe\u8868\u4e3a\u7a7a\u65f6\uff0c\u65b0\u6570\u5bf9\u5374\u88ab\u5206\u914d\u52309\u7ea7\u94fe\u8868\u3002\u8fd9\u79cd\u60c5\u51b5\u6211\u4eec\u53ef\u4ee5\u628a\u7ea7\u6570\u8bbe\u7f6e\u4e3a3\u3002<\/p>\n

\"\"<\/p>\n

\u4e3e\u4e2a\u4f8b\u5b50\u3002\u4f7f\u7528\u8df3\u8868\u63cf\u8ff0\u4e00\u4e2a\u6700\u591a1024\u4e2a\u6570\u5bf9\u7684\u5b57\u5178\u3002\u8bbep=0.5\uff0c\u5219 maxLevel=log\uff081024\uff09-1=9\u3002\u5047\u5b9a\u4ece\u4e00\u4e2a\u7a7a\u5b57\u5178\u5f00\u59cb\uff0c\u7528\u5177\u6709\u4e00\u4e2a\u5934\u8282\u70b9\u548c\u5c3e\u8282\u70b9\u7684\u8df3\u8868\u7ed3\u6784\u63cf\u8ff0\uff0c\u5934\u7ed3\u70b9\u670910\u4e2a\u6307\u9488\uff0c\u6bcf\u4e00\u4e2a\u6307\u9488\u5bf9\u5e94\u4e00\u4e2a\u94fe\u8868\uff0c\u4e14\u4ece\u5934\u7ed3\u70b9\u6307\u5411\u5c3e\u8282\u70b9\u3002\u5f53\u63d2\u5165\u7b2c\u4e00\u4e2a\u6570\u5bf9\u65f6\uff0c\u4e3a\u5176\u57280~9\u4e4b\u95f4\u5206\u914d\u4e00\u4e2a\u7ea7\u6570\u3002\u82e5\u5206\u914d\u7684\u7ea7\u6570\u4e3a9\uff0c\u5219\u56e0\u4e3a\u8df3\u8868\u8fd8\u6ca1\u67090~8\u7ea7\u7684\u8bb0\u5f55\uff0c\u6240\u4ee5\u53ef\u4ee5\u628a\u7b49\u7ea7\u6539\u4e3a0\uff0c\u53ea\u662f\u53ea\u9700\u4fee\u6539\u4e00\u4e2a\u6307\u9488\u5373\u53ef\u3002<\/p>\n

\u5177\u4f53\u7684\u5b9e\u73b0\u8fc7\u7a0b\u5982\u4e0b\uff1a<\/p>\n

<\/code><\/pre>\n
    \n
  1. \n
    \n
    <\/div>\n<\/div>\n
    \n
    #pragma<\/span> once<\/span><\/div>\n<\/div>\n<\/li>\n
  2. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  3. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u8df3\u8868\u7684\u5b9e\u73b0<\/span><\/div>\n<\/div>\n<\/li>\n
  4. \n
    \n
    <\/div>\n<\/div>\n
    \n
    #include<\/span> <iostream><\/span><\/span><\/div>\n<\/div>\n<\/li>\n
  5. \n
    \n
    <\/div>\n<\/div>\n
    \n
    #include<\/span> <math.h><\/span><\/span><\/div>\n<\/div>\n<\/li>\n
  6. \n
    \n
    <\/div>\n<\/div>\n
    \n
    #include<\/span> <sstream><\/span><\/span><\/div>\n<\/div>\n<\/li>\n
  7. \n
    \n
    <\/div>\n<\/div>\n
    \n
    #include<\/span> <string><\/span><\/span><\/div>\n<\/div>\n<\/li>\n
  8. \n
    \n
    <\/div>\n<\/div>\n
    \n
    #include<\/span> “dictionary.h”<\/span><\/span><\/div>\n<\/div>\n<\/li>\n
  9. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  10. \n
    \n
    <\/div>\n<\/div>\n
    \n
    using<\/span> namespace<\/span> std<\/span>;<\/div>\n<\/div>\n<\/li>\n
  11. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  12. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u8df3\u8868\u7684\u8282\u70b9\u7ed3\u6784\uff0c\u8df3\u8868\u7684\u5934\u7ed3\u70b9\u5fc5\u987b\u6709\u8db3\u591f\u7684\u6307\u9488\u57df\uff0c\u4ee5\u6ee1\u8db3\u6700\u5927\u94fe\u8868\u7ea7\u6570\u7684\u6784\u5efa\u9700\u8981\uff0c\u800c\u5c3e\u8282\u70b9\u4e0d\u9700\u8981\u6307\u9488\u57df\u3002<\/span><\/div>\n<\/div>\n<\/li>\n
  13. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u6bcf\u4e00\u4e2a\u5b58\u6709\u6570\u5bf9\u7684\u8282\u70b9\u90fd\u6709\u4e00\u4e2a\u5b58\u50a8\u6570\u5bf9\u7684element\u57df\u548c\u4e00\u4e2a\u5927\u4e8e\u81ea\u8eab\u7ea7\u6570\u7684\u6307\u9488\u57df\uff0c<\/span><\/div>\n<\/div>\n<\/li>\n
  14. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u6307\u9488\u57df\u7528\u6570\u7ec4next\u8868\u793a\uff0c\u5176\u4e2dnext[i]\u8868\u793ai\u7ea7\u94fe\u8868\u7684\u6307\u9488\uff0cnext[0]\u662f0\u7ea7\u4e0a\u7684\u4e0b\u4e00\u4e2a\u8282\u70b9\uff0cnext[i]\u662fi\u7ea7\u4e0a\u7684\u4e0b\u4e00\u4e2a\u8282\u70b9<\/span><\/div>\n<\/div>\n<\/li>\n
  15. \n
    \n
    <\/div>\n<\/div>\n
    \n
    template<\/span> <class<\/span> K<\/span>, class<\/span> E<\/span>><\/span><\/div>\n<\/div>\n<\/li>\n
  16. \n
    \n
    <\/div>\n<\/div>\n
    \n
    struct<\/span> skipNode<\/span><\/div>\n<\/div>\n<\/li>\n
  17. \n
    \n
    <\/div>\n<\/div>\n
    \n
    {<\/div>\n<\/div>\n<\/li>\n
  18. \n
    \n
    <\/div>\n<\/div>\n
    \n
    typedef<\/span> pair<const<\/span> K, E> pairType;<\/div>\n<\/div>\n<\/li>\n
  19. \n
    \n
    <\/div>\n<\/div>\n
    \n
    pairType element;\/\/\u6570\u636e\u57df<\/span><\/div>\n<\/div>\n<\/li>\n
  20. \n
    \n
    <\/div>\n<\/div>\n
    \n
    skipNode<K, E> **next; \/\/ \u6307\u9488\u6570\u7ec4\uff0c\u5927\u5c0f\u53ef\u53d8<\/span><\/div>\n<\/div>\n<\/li>\n
  21. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  22. \n
    \n
    <\/div>\n<\/div>\n
    \n
    skipNode(const<\/span> pairType& thePair, int<\/span> size):element(thePair){<\/div>\n<\/div>\n<\/li>\n
  23. \n
    \n
    <\/div>\n<\/div>\n
    \n
    next = new<\/span> skipNode<K, E>*[size];\/\/\u7c7b\u6bd4new int[size]<\/span><\/div>\n<\/div>\n<\/li>\n
  24. \n
    \n
    <\/div>\n<\/div>\n
    \n
    }<\/div>\n<\/div>\n<\/li>\n
  25. \n
    \n
    <\/div>\n<\/div>\n
    \n
    };<\/div>\n<\/div>\n<\/li>\n
  26. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  27. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  28. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u8df3\u8868<\/span><\/div>\n<\/div>\n<\/li>\n
  29. \n
    \n
    <\/div>\n<\/div>\n
    \n
    template<\/span><class<\/span> K<\/span>, class<\/span> E<\/span>><\/span><\/div>\n<\/div>\n<\/li>\n
  30. \n
    \n
    <\/div>\n<\/div>\n
    \n
    class<\/span> skipList<\/span> : public<\/span> dictionary<K, E><\/div>\n<\/div>\n<\/li>\n
  31. \n
    \n
    <\/div>\n<\/div>\n
    \n
    {<\/div>\n<\/div>\n<\/li>\n
  32. \n
    \n
    <\/div>\n<\/div>\n
    \n
    public<\/span>:<\/div>\n<\/div>\n<\/li>\n
  33. \n
    \n
    <\/div>\n<\/div>\n
    \n
    skipList(K, int<\/span> maxPairs = 10000<\/span>, float<\/span> prob = 0.5<\/span>);<\/div>\n<\/div>\n<\/li>\n
  34. \n
    \n
    <\/div>\n<\/div>\n
    \n
    ~skipList();<\/div>\n<\/div>\n<\/li>\n
  35. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  36. \n
    \n
    <\/div>\n<\/div>\n
    \n
    bool<\/span> empty<\/span>()<\/span> const<\/span> <\/span>{ return<\/span> dSize == 0<\/span>; }<\/div>\n<\/div>\n<\/li>\n
  37. \n
    \n
    <\/div>\n<\/div>\n
    \n
    int<\/span> size<\/span>()<\/span> const<\/span> <\/span>{ return<\/span> dSize; }<\/div>\n<\/div>\n<\/li>\n
  38. \n
    \n
    <\/div>\n<\/div>\n
    \n
    pair<const<\/span> K, E>* find(const<\/span> K&) const<\/span>;<\/div>\n<\/div>\n<\/li>\n
  39. \n
    \n
    <\/div>\n<\/div>\n
    \n
    void<\/span> erase<\/span>(const<\/span> K&)<\/span><\/span>;<\/div>\n<\/div>\n<\/li>\n
  40. \n
    \n
    <\/div>\n<\/div>\n
    \n
    void<\/span> insert<\/span>(const<\/span> pair<const<\/span> K, E>&)<\/span><\/span>;<\/div>\n<\/div>\n<\/li>\n
  41. \n
    \n
    <\/div>\n<\/div>\n
    \n
    void<\/span> output<\/span>(ostream& out)<\/span> const<\/span><\/span>;<\/div>\n<\/div>\n<\/li>\n
  42. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  43. \n
    \n
    <\/div>\n<\/div>\n
    \n
    protected<\/span>:<\/div>\n<\/div>\n<\/li>\n
  44. \n
    \n
    <\/div>\n<\/div>\n
    \n
    float<\/span> cutOff; \/\/ \u7528\u6765\u786e\u5b9a\u5c42\u6570<\/span><\/div>\n<\/div>\n<\/li>\n
  45. \n
    \n
    <\/div>\n<\/div>\n
    \n
    int<\/span> level<\/span>()<\/span> const<\/span><\/span>; \/\/ generate a random level number<\/span><\/div>\n<\/div>\n<\/li>\n
  46. \n
    \n
    <\/div>\n<\/div>\n
    \n
    int<\/span> levels; \/\/ \u5f53\u524d\u6700\u5927\u7684\u975e\u7a7a\u94fe\u8868<\/span><\/div>\n<\/div>\n<\/li>\n
  47. \n
    \n
    <\/div>\n<\/div>\n
    \n
    int<\/span> dSize; \/\/ \u5b57\u5178\u7684\u6570\u5bf9\u4e2a\u6570<\/span><\/div>\n<\/div>\n<\/li>\n
  48. \n
    \n
    <\/div>\n<\/div>\n
    \n
    int<\/span> maxLevel; \/\/ \u5141\u8bb8\u6700\u5927\u7684\u94fe\u8868\u5c42\u6570<\/span><\/div>\n<\/div>\n<\/li>\n
  49. \n
    \n
    <\/div>\n<\/div>\n
    \n
    K tailKey; \/\/ \u6700\u5927\u5173\u952e\u5b57<\/span><\/div>\n<\/div>\n<\/li>\n
  50. \n
    \n
    <\/div>\n<\/div>\n
    \n
    skipNode<K, E>* search(const<\/span> K&) const<\/span>;<\/div>\n<\/div>\n<\/li>\n
  51. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/ search saving last nodes seen<\/span><\/div>\n<\/div>\n<\/li>\n
  52. \n
    \n
    <\/div>\n<\/div>\n
    \n
    skipNode<K, E>* headerNode; \/\/ \u5934\u7ed3\u70b9\u6307\u9488<\/span><\/div>\n<\/div>\n<\/li>\n
  53. \n
    \n
    <\/div>\n<\/div>\n
    \n
    skipNode<K, E>* tailNode; \/\/ \u5c3e\u8282\u70b9\u6307\u9488<\/span><\/div>\n<\/div>\n<\/li>\n
  54. \n
    \n
    <\/div>\n<\/div>\n
    \n
    skipNode<K, E>** last; \/\/ last[i] \u8868\u793a i\u5c42\u7684\u6700\u540e\u4e00\u4e2a\u8282\u70b9<\/span><\/div>\n<\/div>\n<\/li>\n
  55. \n
    \n
    <\/div>\n<\/div>\n
    \n
    };<\/div>\n<\/div>\n<\/li>\n
  56. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  57. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u6784\u9020\u51fd\u6570\u3002\u521d\u59cb\u5316\u7c7b\u7684\u6210\u5458\uff0c\u5e76\u4e3a\u5934\u7ed3\u70b9\u3001\u5c3e\u8282\u70b9\u548c\u6570\u7ec4last\u5206\u914d\u7a7a\u95f4<\/span><\/div>\n<\/div>\n<\/li>\n
  58. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u53c2\u6570largeKey\u7684\u503c\u5927\u4e8e\u5b57\u5178\u4e2d\u4efb\u4f55\u6570\u5bf9\u7684\u5173\u952e\u5b57\uff0c\u5b83\u5b58\u50a8\u5728\u5c3e\u8282\u70b9<\/span><\/div>\n<\/div>\n<\/li>\n
  59. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u53c2\u6570maxPairs\u7684\u503c\u662f\u5b57\u5178\u6570\u5bf9\u4e2a\u6570\u7684\u6700\u5927\u503c\uff0c\u4e00\u822c\u5b57\u5178\u4e0d\u8981\u8d85\u8fc7\u8be5\u503c\u4e3a\u4e86\u7a0b\u5e8f\u6027\u80fd<\/span><\/div>\n<\/div>\n<\/li>\n
  60. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u53c2\u6570prob\u662fi-1\u7ea7\u94fe\u8868\u6570\u5bf9\u540c\u65f6\u4e5f\u662fi\u7ea7\u94fe\u8868\u6570\u5bf9\u7684\u6982\u7387<\/span><\/div>\n<\/div>\n<\/li>\n
  61. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u5728\u63d2\u5165\u548c\u5220\u9664\u64cd\u4f5c\u4e4b\u524d\u7684\u641c\u7d22\u64cd\u4f5c\u6240\u9047\u5230\u7684\u6bcf\u4e00\u7ea7\u94fe\u8868\u7684\u6700\u540e\u4e00\u4e2a\u6570\u5bf9\u90fd\u5b58\u653e\u5728\u6570\u7ec4last\u4e2d<\/span><\/div>\n<\/div>\n<\/li>\n
  62. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u8df3\u8868\u521d\u59cb\u5e03\u5c40\u4e3a\u7a7a\uff0c\u5934\u7ed3\u70b9\u6709maxLevel+1\u4e2a\u6307\u9488\u6307\u5411\u5c3e\u8282\u70b9\u3002<\/span><\/div>\n<\/div>\n<\/li>\n
  63. \n
    \n
    <\/div>\n<\/div>\n
    \n
    template<\/span><class<\/span> K<\/span>,class<\/span> E<\/span>><\/span><\/div>\n<\/div>\n<\/li>\n
  64. \n
    \n
    <\/div>\n<\/div>\n
    \n
    skipList<\/span><K,E>::skipList(K largeKey, int<\/span> maxPairs, float<\/span> prob)<\/div>\n<\/div>\n<\/li>\n
  65. \n
    \n
    <\/div>\n<\/div>\n
    \n
    {\/\/\u6784\u9020\u5173\u952e\u5b57\u5c0f\u4e8elargeKey\u4e14\u6570\u5bf9\u4e2a\u6570size\u5c0f\u4e8emaxPairs\u7684\u8df3\u8868\uff0c0<prob<1<\/span><\/div>\n<\/div>\n<\/li>\n
  66. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  67. \n
    \n
    <\/div>\n<\/div>\n
    \n
    cutOff=prob*RAND_MAX;<\/div>\n<\/div>\n<\/li>\n
  68. \n
    \n
    <\/div>\n<\/div>\n
    \n
    maxLevel=(int<\/span>)ceil<\/span>(logf((float<\/span>)maxPairs)\/logf(1<\/span>\/prob))-1<\/span>;<\/div>\n<\/div>\n<\/li>\n
  69. \n
    \n
    <\/div>\n<\/div>\n
    \n
    levels=0<\/span>;<\/div>\n<\/div>\n<\/li>\n
  70. \n
    \n
    <\/div>\n<\/div>\n
    \n
    dSize=0<\/span>;<\/div>\n<\/div>\n<\/li>\n
  71. \n
    \n
    <\/div>\n<\/div>\n
    \n
    tailKey=largeKey;<\/div>\n<\/div>\n<\/li>\n
  72. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u751f\u6210\u5934\u7ed3\u70b9\u3001\u5c3e\u8282\u70b9\u548c\u6570\u7ec4last<\/span><\/div>\n<\/div>\n<\/li>\n
  73. \n
    \n
    <\/div>\n<\/div>\n
    \n
    pair<K,E> tailPair;<\/div>\n<\/div>\n<\/li>\n
  74. \n
    \n
    <\/div>\n<\/div>\n
    \n
    tailPair.first=tailKey;<\/div>\n<\/div>\n<\/li>\n
  75. \n
    \n
    <\/div>\n<\/div>\n
    \n
    headerNode=new<\/span> skipNode<K,E>(tailPair,maxLevel+1<\/span>);<\/div>\n<\/div>\n<\/li>\n
  76. \n
    \n
    <\/div>\n<\/div>\n
    \n
    tailNode=new<\/span> skipNode<K,E>(tailPair,0<\/span>);<\/div>\n<\/div>\n<\/li>\n
  77. \n
    \n
    <\/div>\n<\/div>\n
    \n
    last=new<\/span> skipNode<K,E> *[maxLevel+1<\/span>];<\/div>\n<\/div>\n<\/li>\n
  78. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  79. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u94fe\u8868\u4e3a\u7a7a\u65f6\uff0c\u4efb\u610f\u7ea7\u94fe\u8868\u4e2d\u7684\u5934\u7ed3\u70b9\u6307\u5411\u5c3e\u8282\u70b9<\/span><\/div>\n<\/div>\n<\/li>\n
  80. \n
    \n
    <\/div>\n<\/div>\n
    \n
    for<\/span>(int<\/span> i=0<\/span>;i<=maxLevel+1<\/span>;i++)<\/div>\n<\/div>\n<\/li>\n
  81. \n
    \n
    <\/div>\n<\/div>\n
    \n
    headerNode->next[i]=tailNode;<\/div>\n<\/div>\n<\/li>\n
  82. \n
    \n
    <\/div>\n<\/div>\n
    \n
    }<\/div>\n<\/div>\n<\/li>\n
  83. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  84. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u6790\u6784\u51fd\u6570\u3002\u5220\u9664\u6240\u6709\u6570\u5bf9\uff0c\u4ee5\u53ca\u6bcf\u4e00\u7ea7\u7684\u6240\u6709\u6570\u5bf9<\/span><\/div>\n<\/div>\n<\/li>\n
  85. \n
    \n
    <\/div>\n<\/div>\n
    \n
    template<\/span><class<\/span> K<\/span>,class<\/span> E<\/span>><\/span><\/div>\n<\/div>\n<\/li>\n
  86. \n
    \n
    <\/div>\n<\/div>\n
    \n
    skipList<\/span><K,E>::~skipList()<\/div>\n<\/div>\n<\/li>\n
  87. \n
    \n
    <\/div>\n<\/div>\n
    \n
    {<\/div>\n<\/div>\n<\/li>\n
  88. \n
    \n
    <\/div>\n<\/div>\n
    \n
    skipNode<K,E> *nextNode;<\/div>\n<\/div>\n<\/li>\n
  89. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u5220\u9664\u6240\u6709\u6570\u5bf9,<\/span><\/div>\n<\/div>\n<\/li>\n
  90. \n
    \n
    <\/div>\n<\/div>\n
    \n
    while<\/span>(headerNode!=tailNode)<\/div>\n<\/div>\n<\/li>\n
  91. \n
    \n
    <\/div>\n<\/div>\n
    \n
    {<\/div>\n<\/div>\n<\/li>\n
  92. \n
    \n
    <\/div>\n<\/div>\n
    \n
    nextNode=headerNode->next[0<\/span>];<\/div>\n<\/div>\n<\/li>\n
  93. \n
    \n
    <\/div>\n<\/div>\n
    \n
    delete<\/span> headerNode;<\/div>\n<\/div>\n<\/li>\n
  94. \n
    \n
    <\/div>\n<\/div>\n
    \n
    headerNode=nextNode;<\/div>\n<\/div>\n<\/li>\n
  95. \n
    \n
    <\/div>\n<\/div>\n
    \n
    }<\/div>\n<\/div>\n<\/li>\n
  96. \n
    \n
    <\/div>\n<\/div>\n
    \n
    delete<\/span> tailNode;<\/div>\n<\/div>\n<\/li>\n
  97. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u5220\u9664\u6570\u7ec4last<\/span><\/div>\n<\/div>\n<\/li>\n
  98. \n
    \n
    <\/div>\n<\/div>\n
    \n
    delete<\/span> [] last;<\/div>\n<\/div>\n<\/li>\n
  99. \n
    \n
    <\/div>\n<\/div>\n
    \n
    }<\/div>\n<\/div>\n<\/li>\n
  100. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  101. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u67e5\u627e\u64cd\u4f5c\uff0c\u67e5\u627e\u5931\u8d25\u8fd4\u56deNULL\uff0c\u6210\u529f\u8fd4\u56de\u8be5\u6570\u5bf9\u7684\u6307\u9488<\/span><\/div>\n<\/div>\n<\/li>\n
  102. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/find\u4ece\u6700\u9ad8\u7ea7\u94fe\u8868\u5f00\u59cb\u641c\u7d22\uff08\u5373level\u7ea7\u94fe\u8868\uff0c\u4ed6\u53ea\u6709\u4e00\u4e2a\u6570\u5bf9\uff09\uff0c\u76f4\u52300\u7ea7\u94fe\u8868\u3002<\/span><\/div>\n<\/div>\n<\/li>\n
  103. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u867d\u7136\u5728i\u7ea7\u94fe\u8868\u4e0a\uff0c\u5c31\u53ef\u80fd\u67e5\u627e\u5230theKey\u5143\u7d20\uff0c\u4f46\u662f\u7528\u6765\u68c0\u9a8c\u662f\u5426\u76f8\u7b49\u7684\u989d\u5916\u64cd\u4f5c\u662f\u4e0d\u5fc5\u8981\u7684\uff0c\u56e0\u4e3a\u5927\u90e8\u5206\u8fd9\u6837\u7684\u6570\u5bf9\u90fd\u53ea\u51fa\u73b0\u57280\u7ea7\u94fe\u8868\u4e2d\u3002<\/span><\/div>\n<\/div>\n<\/li>\n
  104. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u5f53\u4ecefor\u5faa\u73af\u9000\u51fa\u65f6\uff0c\u6307\u9488\u6b63\u597d\u5904\u4e8e\u8981\u67e5\u627e\u7684\u6570\u5bf9\u7684\u5de6\u8fb9\uff0c\u4e0e0\u7ea7\u94fe\u8868\u7684\u4e0b\u4e00\u4e2a\u6570\u5bf9\u6bd4\u8f83\uff0c\u5373\u53ef\u786e\u5b9a\u8981\u6570\u5bf9\u662f\u5426\u5728\u8df3\u8868\u4e2d<\/span><\/div>\n<\/div>\n<\/li>\n
  105. \n
    \n
    <\/div>\n<\/div>\n
    \n
    template<\/span><class<\/span> K<\/span>, class<\/span> E<\/span>><\/span><\/div>\n<\/div>\n<\/li>\n
  106. \n
    \n
    <\/div>\n<\/div>\n
    \n
    pair<\/span><const K,E>* skipList<\/span><K,E>::find(const<\/span> K& theKey) const<\/span><\/div>\n<\/div>\n<\/li>\n
  107. \n
    \n
    <\/div>\n<\/div>\n
    \n
    {<\/div>\n<\/div>\n<\/li>\n
  108. \n
    \n
    <\/div>\n<\/div>\n
    \n
    if<\/span> (theKey >= tailKey)<\/div>\n<\/div>\n<\/li>\n
  109. \n
    \n
    <\/div>\n<\/div>\n
    \n
    return<\/span> NULL<\/span>;<\/div>\n<\/div>\n<\/li>\n
  110. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  111. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/ \u4f4d\u7f6e beforeNode \u662f\u5173\u952e\u5b57\u8282\u70b9\u4e4b\u524d\u7684\u4e00\u4e2a\u8282\u70b9<\/span><\/div>\n<\/div>\n<\/li>\n
  112. \n
    \n
    <\/div>\n<\/div>\n
    \n
    skipNode<K,E>* beforeNode = headerNode;<\/div>\n<\/div>\n<\/li>\n
  113. \n
    \n
    <\/div>\n<\/div>\n
    \n
    for<\/span> (int<\/span> i = levels; i >= 0<\/span>; i–) \/\/ \u4ece\u4e0a\u4e00\u7ea7\u94fe\u8868\u5230\u4e0b\u4e00\u7ea7\u94fe\u8868<\/span><\/div>\n<\/div>\n<\/li>\n
  114. \n
    \n
    <\/div>\n<\/div>\n
    \n
    while<\/span> (beforeNode->next[i]->element.first < theKey)\/\/\u8ddf\u8e2ai\u7ea7\u94fe\u8868\u6307\u9488<\/span><\/div>\n<\/div>\n<\/li>\n
  115. \n
    \n
    <\/div>\n<\/div>\n
    \n
    beforeNode = beforeNode->next[i];<\/div>\n<\/div>\n<\/li>\n
  116. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  117. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/ \u68c0\u67e5\u4e0b\u4e00\u4e2a\u8282\u70b9\u7684\u5173\u952e\u5b57\u662f\u5426\u662ftheKey<\/span><\/div>\n<\/div>\n<\/li>\n
  118. \n
    \n
    <\/div>\n<\/div>\n
    \n
    if<\/span> (beforeNode->next[0<\/span>]->element.first == theKey)<\/div>\n<\/div>\n<\/li>\n
  119. \n
    \n
    <\/div>\n<\/div>\n
    \n
    return<\/span> &beforeNode->next[0<\/span>]->element;<\/div>\n<\/div>\n<\/li>\n
  120. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  121. \n
    \n
    <\/div>\n<\/div>\n
    \n
    return<\/span> NULL<\/span>; \/\/\u5982\u679c\u6ca1\u627e\u5230\uff0c\u8fd4\u56deNULL<\/span><\/div>\n<\/div>\n<\/li>\n
  122. \n
    \n
    <\/div>\n<\/div>\n
    \n
    }<\/div>\n<\/div>\n<\/li>\n
  123. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  124. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u63d2\u5165\u64cd\u4f5c\u5e94\u8be5\u4e3a\u65b0\u7684\u8282\u70b9\u5206\u914d\u7ea7\u6570\uff0c\u5728\u7f16\u5199insert\u63d2\u5165\u64cd\u4f5c\u4e4b\u524d\uff0c\u9700\u8981level\u548csearch\u51fd\u6570<\/span><\/div>\n<\/div>\n<\/li>\n
  125. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/level\u51fd\u6570\u662f\u7ea7\u7684\u5206\u914d\u51fd\u6570\uff0c\u4e3a\u65b0\u6570\u5206\u914d\u5b83\u6240\u5c5e\u7684\u7ea7\u94fe\u8868\uff0c<\/span><\/div>\n<\/div>\n<\/li>\n
  126. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u540c\u65f6search\u51fd\u6570\uff0c\u662f\u641c\u7d22\u51fd\u6570\uff0c\u76ee\u7684\u4ee5\u5b58\u50a8\u6bcf\u4e00\u7ea7\u94fe\u8868\u641c\u7d22\u65f6\u6240\u9047\u5230\u7684\u6700\u540e\u4e00\u8282\u70b9\u7684\u6307\u9488<\/span><\/div>\n<\/div>\n<\/li>\n
  127. \n
    \n
    <\/div>\n<\/div>\n
    \n
    template<\/span><class<\/span> K<\/span>, class<\/span> E<\/span>><\/span><\/div>\n<\/div>\n<\/li>\n
  128. \n
    \n
    <\/div>\n<\/div>\n
    \n
    int<\/span> skipList<\/span><K,E>::level() const<\/span><\/div>\n<\/div>\n<\/li>\n
  129. \n
    \n
    <\/div>\n<\/div>\n
    \n
    {\/\/ \u8fd4\u56de\u4e00\u4e2a\u8868\u793a\u94fe\u8868\u7ea7\u7684\u968f\u673a\u6570 <= maxLevel.<\/span><\/div>\n<\/div>\n<\/li>\n
  130. \n
    \n
    <\/div>\n<\/div>\n
    \n
    int<\/span> lev = 0<\/span>;<\/div>\n<\/div>\n<\/li>\n
  131. \n
    \n
    <\/div>\n<\/div>\n
    \n
    while<\/span> (rand() <= cutOff)<\/div>\n<\/div>\n<\/li>\n
  132. \n
    \n
    <\/div>\n<\/div>\n
    \n
    lev++;<\/div>\n<\/div>\n<\/li>\n
  133. \n
    \n
    <\/div>\n<\/div>\n
    \n
    return<\/span> (lev <= maxLevel) ? lev : maxLevel;<\/div>\n<\/div>\n<\/li>\n
  134. \n
    \n
    <\/div>\n<\/div>\n
    \n
    }<\/div>\n<\/div>\n<\/li>\n
  135. \n
    \n
    <\/div>\n<\/div>\n
    \n
    template<\/span><class<\/span> K<\/span>, class<\/span> E<\/span>><\/span><\/div>\n<\/div>\n<\/li>\n
  136. \n
    \n
    <\/div>\n<\/div>\n
    \n
    skipNode<\/span><K,E>* skipList<\/span><K,E>::search(const<\/span> K& theKey) const<\/span><\/div>\n<\/div>\n<\/li>\n
  137. \n
    \n
    <\/div>\n<\/div>\n
    \n
    {\/\/ \u641c\u7d22\u5173\u952e\u5b57 theKey \uff0c\u628a\u6bcf\u4e00\u7ea7\u94fe\u8868\u4e2d\u8981\u67e5\u770b\u7684\u6700\u540e\u4e00\u4e2a\u8282\u70b9\u5b58\u50a8\u5728\u6570\u7ec4 last \u4e2d<\/span><\/div>\n<\/div>\n<\/li>\n
  138. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/ \u8fd4\u56de\u5173\u952e\u5b57theKey\u7684\u8282\u70b9<\/span><\/div>\n<\/div>\n<\/li>\n
  139. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  140. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/ beforeNode \u662f\u5173\u952e\u5b57theKey\u7684\u8282\u70b9\u7684\u524d\u4e00\u4e2a\u8282\u70b9<\/span><\/div>\n<\/div>\n<\/li>\n
  141. \n
    \n
    <\/div>\n<\/div>\n
    \n
    skipNode<K,E>* beforeNode = headerNode;<\/div>\n<\/div>\n<\/li>\n
  142. \n
    \n
    <\/div>\n<\/div>\n
    \n
    for<\/span> (int<\/span> i = levels; i >= 0<\/span>; i–)<\/div>\n<\/div>\n<\/li>\n
  143. \n
    \n
    <\/div>\n<\/div>\n
    \n
    {<\/div>\n<\/div>\n<\/li>\n
  144. \n
    \n
    <\/div>\n<\/div>\n
    \n
    while<\/span> (beforeNode->next[i]->element.first < theKey)<\/div>\n<\/div>\n<\/li>\n
  145. \n
    \n
    <\/div>\n<\/div>\n
    \n
    beforeNode = beforeNode->next[i];<\/div>\n<\/div>\n<\/li>\n
  146. \n
    \n
    <\/div>\n<\/div>\n
    \n
    last[i] = beforeNode; \/\/ \u6700\u540e\u4e00\u7ea7\u94fe\u8868i\u7684\u8282\u70b9<\/span><\/div>\n<\/div>\n<\/li>\n
  147. \n
    \n
    <\/div>\n<\/div>\n
    \n
    }<\/div>\n<\/div>\n<\/li>\n
  148. \n
    \n
    <\/div>\n<\/div>\n
    \n
    return<\/span> beforeNode->next[0<\/span>];<\/div>\n<\/div>\n<\/li>\n
  149. \n
    \n
    <\/div>\n<\/div>\n
    \n
    }<\/div>\n<\/div>\n<\/li>\n
  150. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  151. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u63d2\u5165\u64cd\u4f5c\uff0c\u5982\u679c\u5b58\u5728\u8be5\u8282\u70b9\u8fdb\u884c\u66f4\u65b0\uff0c\u5426\u5219\u6267\u884c\u63d2\u5165<\/span><\/div>\n<\/div>\n<\/li>\n
  152. \n
    \n
    <\/div>\n<\/div>\n
    \n
    template<\/span><class<\/span> K<\/span>, class<\/span> E<\/span>><\/span><\/div>\n<\/div>\n<\/li>\n
  153. \n
    \n
    <\/div>\n<\/div>\n
    \n
    void<\/span> skipList<\/span><K,E>::insert(const<\/span> pair<const<\/span> K, E>& thePair)<\/div>\n<\/div>\n<\/li>\n
  154. \n
    \n
    <\/div>\n<\/div>\n
    \n
    {<\/div>\n<\/div>\n<\/li>\n
  155. \n
    \n
    <\/div>\n<\/div>\n
    \n
    if<\/span> (thePair.first >= tailKey) \/\/ \u5173\u952e\u5b57\u592a\u5927<\/span><\/div>\n<\/div>\n<\/li>\n
  156. \n
    \n
    <\/div>\n<\/div>\n
    \n
    {<\/div>\n<\/div>\n<\/li>\n
  157. \n
    \n
    <\/div>\n<\/div>\n
    \n
    cerr<\/span> << “Key = “<\/span> << thePair.first << ” Must be < “<\/span> << tailKey;<\/div>\n<\/div>\n<\/li>\n
  158. \n
    \n
    <\/div>\n<\/div>\n
    \n
    exit<\/span>(0<\/span>);<\/div>\n<\/div>\n<\/li>\n
  159. \n
    \n
    <\/div>\n<\/div>\n
    \n
    }<\/div>\n<\/div>\n<\/li>\n
  160. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  161. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/ \u67e5\u770b\u5173\u952e\u5b57\u662f\u5426\u5b58\u5728<\/span><\/div>\n<\/div>\n<\/li>\n
  162. \n
    \n
    <\/div>\n<\/div>\n
    \n
    skipNode<K,E>* theNode = search(thePair.first);<\/div>\n<\/div>\n<\/li>\n
  163. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u5b58\u5728\u7684\u8bdd\uff0c\u8fdb\u884c\u66f4\u65b0<\/span><\/div>\n<\/div>\n<\/li>\n
  164. \n
    \n
    <\/div>\n<\/div>\n
    \n
    if<\/span> (theNode->element.first == thePair.first)<\/div>\n<\/div>\n<\/li>\n
  165. \n
    \n
    <\/div>\n<\/div>\n
    \n
    {<\/div>\n<\/div>\n<\/li>\n
  166. \n
    \n
    <\/div>\n<\/div>\n
    \n
    theNode->element.second = thePair.second;<\/div>\n<\/div>\n<\/li>\n
  167. \n
    \n
    <\/div>\n<\/div>\n
    \n
    return<\/span>;<\/div>\n<\/div>\n<\/li>\n
  168. \n
    \n
    <\/div>\n<\/div>\n
    \n
    }<\/div>\n<\/div>\n<\/li>\n
  169. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  170. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/ \u4e0d\u5b58\u5728\u7684\u8bdd\uff0c\u6267\u884c\u63d2\u5165<\/span><\/div>\n<\/div>\n<\/li>\n
  171. \n
    \n
    <\/div>\n<\/div>\n
    \n
    int<\/span> theLevel = level(); \/\/ \u65b0\u8282\u70b9\u7684\u7ea7<\/span><\/div>\n<\/div>\n<\/li>\n
  172. \n
    \n
    <\/div>\n<\/div>\n
    \n
    if<\/span> (theLevel > levels)\/\/\u4f7f\u5f97\u7ea7\u6570theLevel\u4e3a<=levels+1<\/span><\/div>\n<\/div>\n<\/li>\n
  173. \n
    \n
    <\/div>\n<\/div>\n
    \n
    {<\/div>\n<\/div>\n<\/li>\n
  174. \n
    \n
    <\/div>\n<\/div>\n
    \n
    theLevel = ++levels;<\/div>\n<\/div>\n<\/li>\n
  175. \n
    \n
    <\/div>\n<\/div>\n
    \n
    last[theLevel] = headerNode;<\/div>\n<\/div>\n<\/li>\n
  176. \n
    \n
    <\/div>\n<\/div>\n
    \n
    }<\/div>\n<\/div>\n<\/li>\n
  177. \n
    \n
    <\/div>\n<\/div>\n
    \n
    skipNode<K,E>* newNode = new<\/span> skipNode<K,E>(thePair, theLevel + 1<\/span>);<\/div>\n<\/div>\n<\/li>\n
  178. \n
    \n
    <\/div>\n<\/div>\n
    \n
    for<\/span> (int<\/span> i = 0<\/span>; i <= theLevel; i++)<\/div>\n<\/div>\n<\/li>\n
  179. \n
    \n
    <\/div>\n<\/div>\n
    \n
    {\/\/ \u63d2\u5165i\u7ea7\u94fe\u8868<\/span><\/div>\n<\/div>\n<\/li>\n
  180. \n
    \n
    <\/div>\n<\/div>\n
    \n
    newNode->next[i] = last[i]->next[i];<\/div>\n<\/div>\n<\/li>\n
  181. \n
    \n
    <\/div>\n<\/div>\n
    \n
    last[i]->next[i] = newNode;<\/div>\n<\/div>\n<\/li>\n
  182. \n
    \n
    <\/div>\n<\/div>\n
    \n
    }<\/div>\n<\/div>\n<\/li>\n
  183. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  184. \n
    \n
    <\/div>\n<\/div>\n
    \n
    dSize++;<\/div>\n<\/div>\n<\/li>\n
  185. \n
    \n
    <\/div>\n<\/div>\n
    \n
    return<\/span>;<\/div>\n<\/div>\n<\/li>\n
  186. \n
    \n
    <\/div>\n<\/div>\n
    \n
    }<\/div>\n<\/div>\n<\/li>\n
  187. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  188. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u5220\u9664\u5173\u952e\u5b57\u4e3atheKey\u7684\u6570\u5bf9<\/span><\/div>\n<\/div>\n<\/li>\n
  189. \n
    \n
    <\/div>\n<\/div>\n
    \n
    template<\/span><class<\/span> K<\/span>, class<\/span> E<\/span>><\/span><\/div>\n<\/div>\n<\/li>\n
  190. \n
    \n
    <\/div>\n<\/div>\n
    \n
    void<\/span> skipList<\/span><K,E>::erase(const<\/span> K& theKey)<\/div>\n<\/div>\n<\/li>\n
  191. \n
    \n
    <\/div>\n<\/div>\n
    \n
    {<\/div>\n<\/div>\n<\/li>\n
  192. \n
    \n
    <\/div>\n<\/div>\n
    \n
    if<\/span> (theKey >= tailKey)<\/div>\n<\/div>\n<\/li>\n
  193. \n
    \n
    <\/div>\n<\/div>\n
    \n
    return<\/span>;<\/div>\n<\/div>\n<\/li>\n
  194. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  195. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/ \u67e5\u770b\u662f\u5426\u6709\u5339\u914d\u7684\u6570\u5bf9<\/span><\/div>\n<\/div>\n<\/li>\n
  196. \n
    \n
    <\/div>\n<\/div>\n
    \n
    skipNode<K,E>* theNode = search(theKey);<\/div>\n<\/div>\n<\/li>\n
  197. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u5982\u679c\u6ca1\u6709\u76f4\u63a5\u8fd4\u56de<\/span><\/div>\n<\/div>\n<\/li>\n
  198. \n
    \n
    <\/div>\n<\/div>\n
    \n
    if<\/span> (theNode->element.first != theKey)<\/div>\n<\/div>\n<\/li>\n
  199. \n
    \n
    <\/div>\n<\/div>\n
    \n
    return<\/span>;<\/div>\n<\/div>\n<\/li>\n
  200. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/ \u5982\u679c\u6709\u5220\u9664\u8282\u70b9<\/span><\/div>\n<\/div>\n<\/li>\n
  201. \n
    \n
    <\/div>\n<\/div>\n
    \n
    for<\/span> (int<\/span> i = 0<\/span>; i <= levels &&last[i]->next[i] == theNode; i++)<\/div>\n<\/div>\n<\/li>\n
  202. \n
    \n
    <\/div>\n<\/div>\n
    \n
    last[i]->next[i] = theNode->next[i];<\/div>\n<\/div>\n<\/li>\n
  203. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  204. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/ \u66f4\u65b0\u94fe\u8868\u7ea7<\/span><\/div>\n<\/div>\n<\/li>\n
  205. \n
    \n
    <\/div>\n<\/div>\n
    \n
    while<\/span> (levels > 0<\/span> && headerNode->next[levels] == tailNode)<\/div>\n<\/div>\n<\/li>\n
  206. \n
    \n
    <\/div>\n<\/div>\n
    \n
    levels–;<\/div>\n<\/div>\n<\/li>\n
  207. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  208. \n
    \n
    <\/div>\n<\/div>\n
    \n
    delete<\/span> theNode;<\/div>\n<\/div>\n<\/li>\n
  209. \n
    \n
    <\/div>\n<\/div>\n
    \n
    dSize–;<\/div>\n<\/div>\n<\/li>\n
  210. \n
    \n
    <\/div>\n<\/div>\n
    \n
    }<\/div>\n<\/div>\n<\/li>\n
  211. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  212. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u8f93\u51fa<\/span><\/div>\n<\/div>\n<\/li>\n
  213. \n
    \n
    <\/div>\n<\/div>\n
    \n
    template<\/span><class<\/span> K<\/span>, class<\/span> E<\/span>><\/span><\/div>\n<\/div>\n<\/li>\n
  214. \n
    \n
    <\/div>\n<\/div>\n
    \n
    void<\/span> skipList<\/span><K,E>::output(ostream& out) const<\/span><\/div>\n<\/div>\n<\/li>\n
  215. \n
    \n
    <\/div>\n<\/div>\n
    \n
    {<\/div>\n<\/div>\n<\/li>\n
  216. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/ follow level 0 chain<\/span><\/div>\n<\/div>\n<\/li>\n
  217. \n
    \n
    <\/div>\n<\/div>\n
    \n
    for<\/span> (skipNode<K,E>* currentNode = headerNode->next[0<\/span>]; currentNode != tailNode; currentNode = currentNode->next[0<\/span>])<\/div>\n<\/div>\n<\/li>\n
  218. \n
    \n
    <\/div>\n<\/div>\n
    \n
    out << currentNode->element.first << ” “<\/span> << currentNode->element.second << ” “<\/span>;<\/div>\n<\/div>\n<\/li>\n
  219. \n
    \n
    <\/div>\n<\/div>\n
    \n
    }<\/div>\n<\/div>\n<\/li>\n
  220. \n
    \n
    <\/div>\n<\/div>\n
    \n
    template<\/span> <class<\/span> K<\/span>, class<\/span> E<\/span>><\/span><\/div>\n<\/div>\n<\/li>\n
  221. \n
    \n
    <\/div>\n<\/div>\n
    \n
    ostream<\/span>& operator<\/span><<(ostream& out, const skipList<K,E>& x)<\/span><\/div>\n<\/div>\n<\/li>\n
  222. \n
    \n
    <\/div>\n<\/div>\n
    \n
    {<\/span><\/div>\n<\/div>\n<\/li>\n
  223. \n
    \n
    <\/div>\n<\/div>\n
    \n
     x.output(out); return out;<\/span><\/div>\n<\/div>\n<\/li>\n
  224. \n
    \n
    <\/div>\n<\/div>\n
    \n
    }<\/span><\/div>\n<\/div>\n<\/li>\n<\/ol>\n
    <\/code><\/pre>\n
    \u6d4b\u8bd5\u4ee3\u7801\uff1a<\/p>\n
    <\/code><\/pre>\n
      \n
    1. \n
      \n
      <\/div>\n<\/div>\n
      \n
      \/\/ test skip list class<\/span><\/div>\n<\/div>\n<\/li>\n
    2. \n
      \n
      <\/div>\n<\/div>\n
      \n
      #include<\/span> <iostream><\/span><\/span><\/div>\n<\/div>\n<\/li>\n
    3. \n
      \n
      <\/div>\n<\/div>\n
      \n
      #include<\/span> “skipList.h”<\/span><\/span><\/div>\n<\/div>\n<\/li>\n
    4. \n
      \n
      <\/div>\n<\/div>\n
      \n
      <\/div>\n<\/div>\n<\/li>\n
    5. \n
      \n
      <\/div>\n<\/div>\n
      \n
      using<\/span> namespace<\/span> std<\/span>;<\/div>\n<\/div>\n<\/li>\n
    6. \n
      \n
      <\/div>\n<\/div>\n
      \n
      <\/div>\n<\/div>\n<\/li>\n
    7. \n
      \n
      <\/div>\n<\/div>\n
      \n
      void<\/span> main<\/span>()<\/span><\/span><\/div>\n<\/div>\n<\/li>\n
    8. \n
      \n
      <\/div>\n<\/div>\n
      \n
      {<\/div>\n<\/div>\n<\/li>\n
    9. \n
      \n
      <\/div>\n<\/div>\n
      \n
      skipList<int<\/span>, int<\/span>> z(1000<\/span>);<\/div>\n<\/div>\n<\/li>\n
    10. \n
      \n
      <\/div>\n<\/div>\n
      \n
      pair<int<\/span>, int<\/span>> p;<\/div>\n<\/div>\n<\/li>\n
    11. \n
      \n
      <\/div>\n<\/div>\n
      \n
      <\/div>\n<\/div>\n<\/li>\n
    12. \n
      \n
      <\/div>\n<\/div>\n
      \n
      \/\/ test insert<\/span><\/div>\n<\/div>\n<\/li>\n
    13. \n
      \n
      <\/div>\n<\/div>\n
      \n
      p.first = 2<\/span>; p.second = 10<\/span>;<\/div>\n<\/div>\n<\/li>\n
    14. \n
      \n
      <\/div>\n<\/div>\n
      \n
      z.insert(p);<\/div>\n<\/div>\n<\/li>\n
    15. \n
      \n
      <\/div>\n<\/div>\n
      \n
      p.first = 10<\/span>; p.second = 50<\/span>;<\/div>\n<\/div>\n<\/li>\n
    16. \n
      \n
      <\/div>\n<\/div>\n
      \n
      z.insert(p);<\/div>\n<\/div>\n<\/li>\n
    17. \n
      \n
      <\/div>\n<\/div>\n
      \n
      p.first = 6<\/span>; p.second = 30<\/span>;<\/div>\n<\/div>\n<\/li>\n
    18. \n
      \n
      <\/div>\n<\/div>\n
      \n
      z.insert(p);<\/div>\n<\/div>\n<\/li>\n
    19. \n
      \n
      <\/div>\n<\/div>\n
      \n
      p.first = 8<\/span>; p.second = 40<\/span>;<\/div>\n<\/div>\n<\/li>\n
    20. \n
      \n
      <\/div>\n<\/div>\n
      \n
      z.insert(p);<\/div>\n<\/div>\n<\/li>\n
    21. \n
      \n
      <\/div>\n<\/div>\n
      \n
      p.first = 1<\/span>; p.second = 5<\/span>;<\/div>\n<\/div>\n<\/li>\n
    22. \n
      \n
      <\/div>\n<\/div>\n
      \n
      z.insert(p);<\/div>\n<\/div>\n<\/li>\n
    23. \n
      \n
      <\/div>\n<\/div>\n
      \n
      p.first = 12<\/span>; p.second = 60<\/span>;<\/div>\n<\/div>\n<\/li>\n
    24. \n
      \n
      <\/div>\n<\/div>\n
      \n
      z.insert(p);<\/div>\n<\/div>\n<\/li>\n
    25. \n
      \n
      <\/div>\n<\/div>\n
      \n
      cout<\/span> << “The dictionary is “<\/span> << z << endl<\/span>;<\/div>\n<\/div>\n<\/li>\n
    26. \n
      \n
      <\/div>\n<\/div>\n
      \n
      cout<\/span> << “Its size is “<\/span> << z.size() << endl<\/span>;<\/div>\n<\/div>\n<\/li>\n
    27. \n
      \n
      <\/div>\n<\/div>\n
      \n
      <\/div>\n<\/div>\n<\/li>\n
    28. \n
      \n
      <\/div>\n<\/div>\n
      \n
      \/\/ test find<\/span><\/div>\n<\/div>\n<\/li>\n
    29. \n
      \n
      <\/div>\n<\/div>\n
      \n
      cout<\/span> << “Element associated with 1 is “<\/span> << z.find(1<\/span>)->second << endl<\/span>;<\/div>\n<\/div>\n<\/li>\n
    30. \n
      \n
      <\/div>\n<\/div>\n
      \n
      cout<\/span> << “Element associated with 6 is “<\/span> << z.find(6<\/span>)->second << endl<\/span>;<\/div>\n<\/div>\n<\/li>\n
    31. \n
      \n
      <\/div>\n<\/div>\n
      \n
      cout<\/span> << “Element associated with 12 is “<\/span> << z.find(12<\/span>)->second << endl<\/span>;<\/div>\n<\/div>\n<\/li>\n
    32. \n
      \n
      <\/div>\n<\/div>\n
      \n
      <\/div>\n<\/div>\n<\/li>\n
    33. \n
      \n
      <\/div>\n<\/div>\n
      \n
      \/\/ test erase<\/span><\/div>\n<\/div>\n<\/li>\n
    34. \n
      \n
      <\/div>\n<\/div>\n
      \n
      z.erase(1<\/span>);<\/div>\n<\/div>\n<\/li>\n
    35. \n
      \n
      <\/div>\n<\/div>\n
      \n
      z.erase(2<\/span>);<\/div>\n<\/div>\n<\/li>\n
    36. \n
      \n
      <\/div>\n<\/div>\n
      \n
      z.erase(6<\/span>);<\/div>\n<\/div>\n<\/li>\n
    37. \n
      \n
      <\/div>\n<\/div>\n
      \n
      z.erase(12<\/span>);<\/div>\n<\/div>\n<\/li>\n
    38. \n
      \n
      <\/div>\n<\/div>\n
      \n
      cout<\/span> << “Deleted 1, 2, 6, 12”<\/span> << endl<\/span>;<\/div>\n<\/div>\n<\/li>\n
    39. \n
      \n
      <\/div>\n<\/div>\n
      \n
      cout<\/span> << “The dictionary is “<\/span> << z << endl<\/span>;<\/div>\n<\/div>\n<\/li>\n
    40. \n
      \n
      <\/div>\n<\/div>\n
      \n
      cout<\/span> << “Its size is “<\/span> << z.size() << endl<\/span>;<\/div>\n<\/div>\n<\/li>\n
    41. \n
      \n
      <\/div>\n<\/div>\n
      \n
      }<\/div>\n<\/div>\n<\/li>\n<\/ol>\n
      <\/code><\/pre>\n<\/div>\n<\/div>\n<\/article>\n","protected":false},"excerpt":{"rendered":"
      \u539f\u6587\u5730\u5740   2016\u5e7408\u6708<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"colormag_page_container_layout":"default_layout","colormag_page_sidebar_layout":"default_layout","footnotes":""},"categories":[],"tags":[119],"class_list":["post-3626","post","type-post","status-publish","format-standard","hentry","tag-03-"],"_links":{"self":[{"href":"https:\/\/i007.cc\/wordpress\/wp-json\/wp\/v2\/posts\/3626","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/i007.cc\/wordpress\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/i007.cc\/wordpress\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/i007.cc\/wordpress\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/i007.cc\/wordpress\/wp-json\/wp\/v2\/comments?post=3626"}],"version-history":[{"count":0,"href":"https:\/\/i007.cc\/wordpress\/wp-json\/wp\/v2\/posts\/3626\/revisions"}],"wp:attachment":[{"href":"https:\/\/i007.cc\/wordpress\/wp-json\/wp\/v2\/media?parent=3626"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/i007.cc\/wordpress\/wp-json\/wp\/v2\/categories?post=3626"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/i007.cc\/wordpress\/wp-json\/wp\/v2\/tags?post=3626"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}