{"id":600,"date":"2021-08-31T10:50:26","date_gmt":"2021-08-31T02:50:26","guid":{"rendered":"https:\/\/swordofmorning.com\/?p=600"},"modified":"2025-10-09T13:55:52","modified_gmt":"2025-10-09T05:55:52","slug":"pgexam-data-structure-01","status":"publish","type":"post","link":"https:\/\/swordofmorning.com\/index.php\/2021\/08\/31\/pgexam-data-structure-01\/","title":{"rendered":"\u8003\u7814\u6570\u636e\u7ed3\u6784 01 \u7ebf\u6027\u8868"},"content":{"rendered":"
\n
<\/path><\/path><\/path><\/path><\/path><\/path><\/path><\/path><\/path><\/path><\/path><\/path><\/defs>\u7ebf<\/text><\/g>\u6027<\/text><\/g>\u8868<\/text><\/g><\/use><\/use><\/use><\/use><\/svg><\/use><\/svg><\/g>\u987a<\/text><\/g>\u5e8f<\/text><\/g>\u5b58<\/text><\/g>\u50a8<\/text><\/g><\/use><\/g><\/use><\/g><\/use><\/g>\u987a<\/text><\/g>\u5e8f<\/text><\/g>\u8868<\/text><\/g><\/g><\/g><\/g>\u94fe<\/text><\/g>\u5f0f<\/text><\/g>\u5b58<\/text><\/g>\u50a8<\/text><\/g><\/use><\/use><\/use><\/use><\/svg><\/use><\/svg><\/g><\/g>\u5355<\/text><\/g>\u94fe<\/text><\/g>\u8868<\/text><\/g><\/g><\/g><\/g>\u53cc<\/text><\/g>\u94fe<\/text><\/g>\u8868<\/text><\/g><\/g><\/g><\/g>\u5faa<\/text><\/g>\u73af<\/text><\/g>\u94fe<\/text><\/g>\u8868<\/text><\/g><\/g><\/g><\/g><\/g><\/g><\/use><\/use><\/use><\/use><\/svg><\/use><\/svg><\/g><\/g><\/g>\u6307<\/text><\/g>\u9488<\/text><\/g>\u5b9e<\/text><\/g>\u73b0<\/text><\/g><\/g><\/g><\/g>\u9759<\/text><\/g>\u6001<\/text><\/g>\u94fe<\/text><\/g>\u8868<\/text><\/g>\uff08<\/text><\/g>\u6570<\/text><\/g>\u7ec4<\/text><\/g>\u5b9e<\/text><\/g>\u73b0<\/text><\/g>\uff09<\/text><\/g><\/g><\/g><\/g><\/g><\/g><\/g><\/g><\/g><\/g><\/g><\/g><\/g><\/g><\/g><\/g><\/g><\/g><\/g><\/g><\/g><\/g><\/g><\/g><\/svg><\/use><\/use><\/use><\/g><\/g><\/g><\/svg><\/g><\/g><\/g><\/g><\/svg><\/mjx-container><\/div>\n<\/div>\n

  \u8003\u8bd5\u91cd\u70b9\uff1a\u65f6\u95f4\u590d\u6742\u5ea6\u3001\u7a7a\u95f4\u590d\u6742\u5ea6\u7684\u6700\u4f18\u6027\u80fd\u3002<\/p>\n

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

\u4e00\u3001\u7ebf\u6027\u8868<\/h2>\n

1.1 \u7ebf\u6027\u8868\u57fa\u672c\u6982\u5ff5<\/h3>\n

  \u7ebf\u6027\u8868\u662f\u5177\u6709\u76f8\u540c\u6570\u636e\u7c7b\u578b\u7684n(n>=0)\u4e2a\u6570\u636e\u5143\u7d20\u7684\u6709\u9650\u5e8f\u5217<\/strong>\uff0c\u5176\u4e2dn\u4e3a\u8868\u957f\uff0c\u5f53n=0\u65f6\uff0c\u7ebf\u6027\u8868\u662f\u4e00\u4e2a\u7a7a\u8868\u3002\u82e5\u7528L\u547d\u540d\u7ebf\u6027\u8868\uff0c\u5219\u5176\u4e00\u822c\u8868\u793a\u4e3aL=(a1<\/sub>, a2<\/sub>...an<\/sub>)\u3002<\/p>\n

  \u5176\u4e2da1<\/sub>\u662f\u552f\u4e00\u4e00\u4e2a\u201c\u7b2c\u4e00\u4e2a\u201d\u6570\u636e\u5143\u7d20\uff0c\u53c8\u79f0\u8868\u5934\u5143\u7d20\uff1ban<\/sub>\u662f\u552f\u4e00\u4e00\u4e2a\u201c\u6700\u540e\u5143\u7d20\u201d\uff0c\u4e5f\u79f0\u8868\u5c3e\u5143\u7d20\u3002\u9664\u7b2c\u4e00\u4e2a\u5143\u7d20\u5916\uff0c\u6bcf\u4e00\u4e2a\u5143\u7d20\u6709\u4e14\u4ec5\u6709<\/strong>\u4e00\u4e2a\u76f4\u63a5\u524d\u9a71\uff1b\u9664\u6700\u540e\u4e00\u4e2a\u5143\u7d20\u5916\uff0c\u6bcf\u4e00\u4e2a\u5143\u7d20\u6709\u4e14\u4ec5\u6709<\/strong>\u4e00\u4e2a\u76f4\u63a5\u540e\u9a71\u3002<\/p>\n

  \u7279\u70b9\uff1a<\/p>\n

    \n
  1. \u8868\u4e2d\u5143\u7d20\u4e2a\u6570\u6709\u9650\u3002<\/li>\n
  2. \u8868\u4e2d\u5143\u7d20\u5177\u6709\u903b\u8f91\u4e0a\u7684\u987a\u5e8f\u6027\uff0c\u8868\u4e2d\u5143\u7d20\u90fd\u6709\u5148\u540e\u987a\u5e8f\u3002<\/li>\n
  3. \u8868\u4e2d\u90fd\u662f\u6570\u636e\u5143\u7d20\uff0c\u6bcf\u4e2a\u5143\u7d20\u90fd\u662f\u5355\u4e2a\u5143\u7d20\u3002<\/li>\n
  4. \u8868\u4e2d\u5143\u7d20\u6570\u636e\u7c7b\u578b\u76f8\u540c\uff0c\u5373\u6bcf\u4e2a\u5143\u7d20\u5360\u7528\u76f8\u540c\u7684\u5b58\u50a8\u7a7a\u95f4\u3002<\/li>\n
  5. \u8868\u4e2d\u5143\u7d20\u5177\u6709\u62bd\u8c61\u6027\uff0c\u5373\u4ec5\u8ba8\u8bba\u5143\u7d20\u76f4\u63a5\u7684\u903b\u8f91\u5173\u7cfb\uff0c\u800c\u4e0d\u8003\u8651\u5143\u7d20\u8868\u793a\u4ec0\u4e48\u5185\u5bb9\u3002<\/li>\n<\/ol>\n

    1.2 \u7ebf\u6027\u8868\u57fa\u672c\u64cd\u4f5c<\/h3>\n
      \n
    • InitList(&L)\uff1a\u521d\u59cb\u5316\uff0c\u6784\u9020\u7a7a\u8868\u3002<\/li>\n
    • Length(L)\uff1a\u8fd4\u56de\u8868\u957f\uff08\u5143\u7d20\u4e2a\u6570\uff09\u3002<\/li>\n
    • LocateElem(L, e)\uff1a\u8fd4\u56de\u5143\u7d20\u4f4d\u7f6e\uff0c\u8fd4\u56deint posi\u3002<\/li>\n
    • GetElem(L, i)\uff1a\u83b7\u53d6\u6307\u5b9a\u4f4d\u7f6e\u7684\u5143\u7d20\u503c\uff0c\u8fd4\u56deelemType val\u3002<\/li>\n
    • ListInsert(&L, i, e)\uff1a\u4f4d\u7f6ei\u5904\u63d2\u5165\u5143\u7d20e\uff0c\u8fd4\u56debool\u3002<\/li>\n
    • ListDelete(&L, i)\uff1a\u5220\u9664\u4f4d\u7f6ei\u5904\u7684\u5143\u7d20\uff0c\u8fd4\u56debool\u3002<\/li>\n
    • PrintList(L)\uff1a\u6253\u5370\u3002<\/li>\n
    • Empty(L)\uff1a\u5224\u65ad\u662f\u5426\u4e3a\u7a7a\uff0c\u8fd4\u56debool\u3002<\/li>\n
    • DestoryList(&L)\uff1a\u5220\u9664\u8868\u3002<\/li>\n<\/ul>\n

      \u4e8c\u3001\u987a\u5e8f\u8868<\/h2>\n

      2.1 \u987a\u5e8f\u8868\u7684\u5b9a\u4e49<\/h3>\n

        \u5143\u7d20\u903b\u8f91\u76f8\u90bb\uff0c\u5730\u5740\u76f8\u90bb\uff0c\u8fd9\u4e00\u7279\u6027\u4f7f\u5f97\u987a\u5e8f\u8868\u652f\u6301\u968f\u673a\u5b58\u50a8<\/strong>\u3002<\/p>\n

        \u987a\u5e8f\u8868\u652f\u6301\u52a8\u6001\u5206\u914d\u548c\u9759\u6001\u5206\u914d\uff0c\u9759\u6001\u5206\u914d\u548c\u5e73\u5e38\u4f7f\u7528\u7684\u6570\u7ec4\u76f8\u540c\u3002\u52a8\u6001\u5206\u914d\u5728\u8868\u6ee1\u4e4b\u540e\uff0c\u9700\u8981\u5f00\u8f9f\u4e00\u5757\u5927\u4e8e\u539f\u6765\u7a7a\u95f4\u7684\u5185\u5b58\uff0c\u7136\u540e\u5c06\u5f53\u524d\u8868\u4e2d\u7684\u5185\u5bb9\u62f7\u8d1d\u8fc7\u53bb\u3002<\/p>\n

        \u5176\u7ed3\u6784\u4e3a\uff1a<\/p>\n

      typedef struct{\n    elemType data[MaxSize];\n    int length;\n}sqList;\n<\/code><\/pre>\n
        \u4f18\u70b9\uff1a<\/p>\n
        \n
      • \u968f\u673a\u8bbf\u95ee\uff0c\u67e5\u627e\u6307\u5b9a\u4e0b\u6807\u7684\u65f6\u95f4\u6548\u7387\u4e3aO(1)\u3002<\/li>\n
      • \u5b58\u50a8\u5bc6\u5ea6\u9ad8\uff0c\u6bcf\u4e2a\u8282\u70b9\u503c\u5b58\u50a8\u6570\u636e\u5143\u7d20\u672c\u8eab\u3002<\/li>\n<\/ul>\n
          \u7f3a\u70b9\uff1a<\/p>\n
          \n
        • \u63d2\u5165\u548c\u5220\u9664\u9700\u8981\u79fb\u52a8\u5927\u91cf\u5143\u7d20\u3002<\/li>\n<\/ul>\n
          2.2 \u987a\u5e8f\u8868\u7684\u64cd\u4f5c\u4e0e\u5b9e\u73b0<\/h3>\n
          2.2.1 \u63d2\u5165<\/h4>\n
            \u63d2\u5165\u5143\u7d20ele\u5230idx\uff0c1 <= idx <= length+1\u3002<\/p>\n
          bool ListInsert(sqList& L, int idx, elemType ele)\n{\n    \/\/ \u8fb9\u754c\u5224\u65ad\n    if (idx < 1 || idx > L.length + 1)\n    {\n        return false;\n    }\n    \/\/ \u65e0\u5269\u4f59\u7a7a\u95f4\n    else if (L.length >= MaxSize)\n    {\n        return false;\n    }\n\n    \/\/ \u79fb\u52a8idx\u4ee5\u53ca\u4e4b\u540e\u7684\u5143\u7d20\n    for (int idx_move = L.length; idx_move >= idx; --idx_move)\n    {\n        L.data[idx_move] = L.data[idx_move - 1];\n    }\n    \/\/ \u63d2\u5165\u65b0\u5143\u7d20\n    L[idx-1] = ele;\n    L.length++;\n\n    return true;\n}\n<\/code><\/pre>\n
            \u590d\u6742\u5ea6\u8ba1\u7b97\uff1a<\/p>\n
            \n
          • \u6700\u597d\uff1aO(1)\uff0c\u5c3e\u63d2idx = n + 1\u3002<\/li>\n
          • \u6700\u574f\uff1aO(n)\uff0c\u5934\u63d2idx = 1\u3002<\/li>\n
          • \u5e73\u5747\uff1aO(n)<\/li>\n<\/ul>\n
              \u5e73\u5747\u590d\u6742\u5ea6\uff1a<\/p>\n
              \u5047\u8bbe<\/path><\/path><\/path><\/path><\/path><\/path><\/defs><\/use><\/g><\/g><\/g><\/use><\/g><\/g><\/g><\/g><\/use><\/g><\/use><\/g><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/rect><\/g><\/g><\/g><\/g><\/svg><\/mjx-container>
            \n
            <\/path><\/path><\/path><\/path><\/path><\/path><\/path><\/path><\/path><\/path><\/path><\/path><\/path><\/defs><\/use><\/g><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/g><\/g><\/use><\/g><\/use><\/g><\/g><\/g><\/use><\/g><\/g><\/g><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/use><\/g><\/g><\/g><\/use><\/g><\/use><\/g><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/rect><\/g><\/use><\/g><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/g><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/use><\/g><\/g><\/g><\/g><\/g><\/use><\/g><\/use><\/g><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/rect><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/use><\/g><\/g><\/g><\/g><\/use><\/g><\/g><\/rect><\/g><\/use><\/g><\/use><\/g><\/g><\/use><\/g><\/g><\/rect><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/use><\/g><\/g><\/g><\/g><\/g><\/g><\/g><\/g><\/svg><\/text><\/use><\/use><\/use><\/g><\/g><\/g><\/g><\/svg><\/g><\/g><\/g><\/g><\/svg><\/mjx-container><\/div>\n<\/div>\n
            2.2.2 \u5220\u9664<\/h4>\n
              \u5220\u9664idx\u5904\u7684\u5143\u7d20\uff0c1 <= idx <= length\u3002<\/p>\n
            bool ListDelete(sqList& L, int idx)\n{\n    \/\/ \u8fb9\u754c\u5224\u65ad\n    if (idx < 1 || idx > L.length)\n    {\n        return false;\n    }\n\n    \/\/ \u5143\u7d20\u524d\u79fb\n    for (int idx_move = idx; idx < L.lenth; ++idx_move)\n    {\n        L[idx_move-1] = L[idx_move];\n    }\n    L.length--;\n\n    return true;\n}\n<\/code><\/pre>\n
              \u590d\u6742\u5ea6\u8ba1\u7b97\uff1a<\/p>\n
              \n
            • \u6700\u597d\uff1aO(1)\uff0c\u5c3e\u5220idx = n\u3002<\/li>\n
            • \u6700\u574f\uff1aO(n)\uff0c\u5934\u63d2idx = 1\u3002<\/li>\n
            • \u5e73\u5747\uff1aO(n)<\/li>\n<\/ul>\n
                \u5e73\u5747\u590d\u6742\u5ea6\uff1a<\/p>\n
                \u5047\u8bbe<\/path><\/path><\/path><\/path><\/path><\/defs><\/use><\/g><\/g><\/g><\/use><\/g><\/g><\/g><\/g><\/use><\/g><\/use><\/g><\/g><\/use><\/g><\/g><\/rect><\/g><\/g><\/g><\/g><\/svg><\/mjx-container>
              \n
              <\/path><\/path><\/path><\/path><\/path><\/path><\/path><\/path><\/path><\/path><\/path><\/path><\/path><\/path><\/defs><\/use><\/g><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/g><\/g><\/use><\/g><\/use><\/g><\/g><\/g><\/use><\/g><\/g><\/g><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/use><\/g><\/g><\/g><\/use><\/g><\/use><\/g><\/g><\/use><\/g><\/g><\/rect><\/g><\/use><\/g><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/g><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/use><\/g><\/g><\/g><\/g><\/g><\/use><\/g><\/use><\/g><\/g><\/use><\/g><\/g><\/rect><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/use><\/g><\/g><\/g><\/g><\/use><\/g><\/g><\/rect><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/use><\/g><\/g><\/rect><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/use><\/g><\/g><\/g><\/g><\/g><\/g><\/g><\/g><\/svg><\/text><\/use><\/use><\/use><\/g><\/g><\/g><\/g><\/svg><\/g><\/g><\/g><\/g><\/svg><\/mjx-container><\/div>\n<\/div>\n
              2.2.3 \u6309\u503c\u67e5\u627e\uff08\u987a\u5e8f\u67e5\u627e\uff09<\/h4>\n
                \u67e5\u627e\u5143\u7d20ele\uff0c1 <= idx <= length\u3002<\/p>\n
              int LocoteElem(sqList& L, elemType e)\n{\n    int idx = 0;\n    for (; idx < L.length; ++idx)\n    {\n        if (L.data[idx] == e)\n        {\n            return idx + 1;\n        }\n    }\n\n    return 0;\n}\n<\/code><\/pre>\n
                \u590d\u6742\u5ea6\u8ba1\u7b97\uff1a<\/p>\n
                \n
              • \u6700\u597d\uff1aO(1)\uff0c\u5934idx = 1\u3002<\/li>\n
              • \u6700\u574f\uff1aO(n)\uff0c\u5c3eidx = n\uff0c\u6216\u8005\u5143\u7d20\u4e0d\u5b58\u5728\u3002<\/li>\n
              • \u5e73\u5747\uff1aO(n)<\/li>\n<\/ul>\n
                  \u5047\u8bbe<\/path><\/path><\/path><\/path><\/path><\/defs><\/use><\/g><\/g><\/g><\/use><\/g><\/g><\/g><\/g><\/use><\/g><\/use><\/g><\/g><\/use><\/g><\/g><\/rect><\/g><\/g><\/g><\/g><\/svg><\/mjx-container>
                \n
                <\/path><\/path><\/path><\/path><\/path><\/path><\/path><\/path><\/path><\/path><\/path><\/path><\/path><\/defs><\/use><\/g><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/g><\/g><\/use><\/g><\/use><\/g><\/g><\/g><\/use><\/g><\/g><\/g><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/use><\/g><\/g><\/g><\/use><\/g><\/use><\/g><\/g><\/use><\/g><\/g><\/rect><\/g><\/use><\/g><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/g><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/use><\/g><\/g><\/g><\/g><\/g><\/use><\/g><\/use><\/g><\/g><\/use><\/g><\/g><\/rect><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/use><\/g><\/g><\/g><\/g><\/use><\/g><\/g><\/rect><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/use><\/g><\/g><\/rect><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/use><\/g><\/g><\/use><\/g><\/g><\/g><\/g><\/g><\/g><\/g><\/g><\/svg><\/text><\/use><\/use><\/use><\/g><\/g><\/g><\/g><\/svg><\/g><\/g><\/g><\/g><\/svg><\/mjx-container><\/div>\n<\/div>\n
                \u4e09\u3001\u94fe\u8868<\/h2>\n
                3.1 \u5355\u94fe\u8868<\/h3>\n
                  \u7ebf\u6027\u8868\u7684\u94fe\u5f0f\u5b58\u50a8\u7ed3\u6784\u53c8\u53eb\u5355\u94fe\u8868\uff0c\u5b83\u6307\u901a\u8fc7\u4e00\u7ec4\u4efb\u610f\u7684\u5b58\u50a8\u5355\u5143\u6765\u5b58\u50a8\u7ebf\u6027\u8868\u4e2d\u7684\u6570\u636e\u5143\u7d20\u3002\u4e3a\u4e86\u5efa\u7acb\u5143\u7d20\u76f4\u63a5\u7684\u7ebf\u6027\u5173\u7cfb\uff0c\u5bf9\u6bcf\u4e2a\u94fe\u8868\u7684\u9636\u6bb5\uff0c\u9664\u4e86\u5b58\u653e\u6570\u636e\u5143\u7d20<\/strong>\u5916\uff0c\u8fd8\u8981\u5b58\u653e\u4e00\u4e2a\u6307\u5411\u540e\u7eaa\u5143\u7d20\u7684\u6307\u9488<\/strong>\u3002<\/p>\n
                  \u5176\u8282\u70b9\u7684\u7ed3\u6784\u4e3a\uff1a<\/p>\n
                typedef struct Node{\n    elemType data;\n    struct Node* next;\n}Node;\n<\/code><\/pre>\n
                  \u4f18\u70b9\uff1a<\/p>\n
                  \n
                • \u63d2\u5165\u5220\u9664\u901f\u5ea6\u5feb\u3002<\/li>\n<\/ul>\n
                    \u7f3a\u70b9\uff1a<\/p>\n
                    \n
                  • \u67e5\u627e\u901f\u5ea6\u6162\u3002<\/li>\n<\/ul>\n
                    3.2 \u5355\u94fe\u8868\u7684\u64cd\u4f5c<\/h3>\n
                    3.2.1 \u65b0\u5efa\u5355\u94fe\u8868 - \u5934\u63d2\u6cd5<\/h4>\n
                      \u5c06ele\u63d2\u5165\u5230\u94fe\u8868\u5934\u90e8\u3002<\/p>\n
                    \/\/ \u53c2\u6570\uff1a\u88ab\u63d2\u5165\u5143\u7d20\u6307\u9488\u3001\u88ab\u63d2\u5165\u5143\u7d20\u4e2a\u6570\nNode* Init_Front(elemType* ele, int length)\n{\n    \/\/ \u5934\u7ed3\u70b9\n    Node* head = (Node*)malloc(sizeof(Node));\n    head->data = *(ele);\n    head->next = NULL;\n\n    \/\/ \u5176\u4f59\u7ed3\u70b9\n    for (int i = 1; i < length; ++i)\n    {\n        Node* newNode = (Node*)malloc(sizeof(Node));\n        newNode->next = head;\n        newNode->data = *(ele + i);\n\n        head = newNode;\n    }\n\n    return head;\n} \n<\/code><\/pre>\n
                    3.2.2 \u65b0\u5efa\u5355\u94fe\u8868 - \u5c3e\u63d2\u6cd5<\/h4>\n
                      \u5c06ele\u63d2\u5165\u5230\u94fe\u8868\u5c3e\u90e8\u3002<\/p>\n
                    \/\/ \u53c2\u6570\uff1a\u88ab\u63d2\u5165\u5143\u7d20\u6307\u9488\u3001\u88ab\u63d2\u5165\u5143\u7d20\u4e2a\u6570\nNode* Init_Back(elemType* ele, int length)\n{\n    \/\/ \u5934\u7ed3\u70b9\n    Node* head = (Node*)malloc(sizeof(Node));\n    head->data = *(ele);\n    head->next = NULL;\n\n    \/\/ \u63d2\u5165\u52a8\u4f5c\u6307\u9488\n    Node* ins = head;\n\n    \/\/ \u5176\u4f59\u7ed3\u70b9\n    for (int i = 1; i < length; ++i)\n    {\n        Node* newNode = (Node*)malloc(sizeof(Node));\n        newNode->data = *(ele + i);\n        newNode->next = NULL;\n\n        ins->next = newNode;\n    }\n\n    return head;\n} \n<\/code><\/pre>\n
                    3.2.3 \u6309\u5e8f\u53f7\u67e5\u627e<\/h4>\n
                      \u8fd9\u91cc\u4e0b\u6807\u4ece0\u5f00\u59cb\u3002<\/p>\n
                    Node* Get_Idx(Node* head, int idx)\n{\n    Node* poi = head;\n\n    \/\/ \u8fb9\u754c\u5224\u65ad\n    if (idx < 0)\n    {\n        return NULL;\n    }\n\n    \/\/ \u4e3a\u5934\u7ed3\u70b9\n    if (idx == 0)\n    {\n        return poi;\n    }\n\n    \/\/ \u4e3a\u5176\u4ed6\u7ed3\u70b9\n    for (int i = 0; i < idx; ++i)\n    {\n        if (!poi->next)\n        {\n            return NULL;\n        }\n\n        poi = poi->next;\n    }\n\n    return poi;\n}\n<\/code><\/pre>\n
                    3.2.4 \u6309\u503c\u67e5\u627e<\/h4>\n
                      \u8fd4\u56de\u7b2c\u4e00\u4e2a\u627e\u5230\u7684\u5143\u7d20\u3002<\/p>\n
                    Node* Get_Val(Node* head, elemType val)\n{\n    Node* poi = head;\n\n    while(poi)\n    {\n        if (poi->data == val)\n        {\n            return poi;\n        }\n\n        poi = poi->next;\n    }\n\n    return NULL;\n}\n<\/code><\/pre>\n
                    3.2.5 \u63d2\u5165<\/h4>\n
                      \u7ed3\u70b9\u540e\u63d2\u5165\uff1a<\/p>\n
                    \/\/ \u53c2\u6570\u8bf4\u660e\uff1a\u5934\u7ed3\u70b9\u3001\u63d2\u5165\u76ee\u6807\u7684idx\u3001\u63d2\u5165\u7684\u5143\u7d20\u503c\nbool Insert_Back(Node* head, int idx, elemType ele)\n{\n    \/\/ \u83b7\u53d6\u63d2\u5165\u76ee\u6807\n    Node* target = Get_Idx(head, idx);\n\n    \/\/ \u8fb9\u754c\u503c\u68c0\u6d4b\n    if (!target)\n    {\n        return false;\n    }\n\n    \/\/ \u65b0\u8282\u70b9\u521d\u59cb\u5316\n    Node* newNode = (Node*)malloc(sizeof(Node));\n    newNode->data = ele;\n\n    \/\/ \u5c3e\u90e8\n    target->next == NULL ?\n        newNode->next = NULL :          \/\/ \u662f\u5c3e\u90e8\uff0c\u65b0\u8282\u70b9\u540e\u65e0\u8282\u70b9\n    newNode->next = target->next;   \/\/ \u4e0d\u662f\u5c3e\u90e8\uff0c\u65b0\u8282\u70b9\u540e\u63a5target->next\n\n    target->next = newNode;\n\n    return true;\n}\n<\/code><\/pre>\n
                      \u7ed3\u70b9\u524d\u63d2\u5165\uff1a<\/p>\n
                    bool Insert_Front(Node* head, int idx, elemType ele)\n{\n    \/\/ \u83b7\u53d6\u63d2\u5165\u76ee\u6807\n    Node* target = Get_Idx(head, idx);\n\n    \/\/ \u8fb9\u754c\u503c\u68c0\u6d4b\n    if (!target)\n    {\n        return false;\n    }\n\n    \/\/ \u65b0\u8282\u70b9\u521d\u59cb\u5316\n    Node* newNode = (Node*)malloc(sizeof(Node));\n    newNode->data = ele;\n\n    \/\/ \u5934\u90e8\n    if (target == head)\n    {\n        \/\/ \u8fde\u63a5\n        newNode->next = head;\n        \/\/ \u79fb\u52a8\u5934\u90e8\u6307\u9488\n        head = newNode;\n    }\n    else if (target != head)\n    {\n        \/\/ \u9009\u62e9target\u7684\u524d\u4e00\u4e2a\u8282\u70b9\uff0c\u8f6c\u6362\u4e3a\u5c3e\u63d2\n        Insert_Back(head, idx - 1, ele);\n    }\n\n    return true;\n}\n<\/code><\/pre>\n
                    3.2.6 \u5220\u9664\u8282\u70b9<\/h4>\n
                      \u6309\u5e8f\u53f7\uff08\u4ece0\u8ba1\u6570\uff09\u5220\u9664\u3002<\/p>\n
                    bool Delete_Idx(Node* head, int idx)\n{\n    \/\/ \u83b7\u53d6\u5220\u9664\u76ee\u6807\n    Node* target = Get_Idx(head, idx);\n\n    \/\/ \u8fb9\u754c\u503c\u68c0\u6d4b\n    if (!target)\n    {\n        return false;\n    }\n\n    \/\/ \u5934\u90e8\n    if (target == head)\n    {\n        Node* dele = head;\n        head = head->next;\n        free(dele);\n    }\n    \/\/ \u5c3e\u90e8\n    else if (target->next == NULL)\n    {\n        free(target);\n    }\n    \/\/ \u4e2d\u95f4\u8282\u70b9\n    else\n    {\n        Node* target_bf = Get_Idx(head, idx - 1);\n        target_bf->next = target->next;\n        free(target);\n    }\n\n    return true;\n}\n<\/code><\/pre>\n
                      \u6309\u503c\u5220\u9664\u3002<\/p>\n
                    bool Delete_Val(Node* head, int idx)\n{\n    \/\/ \u83b7\u53d6\u5220\u9664\u76ee\u6807\n    Node* target = Get_Val(head, idx);\n\n    \/\/ \u8fb9\u754c\u503c\u68c0\u6d4b\n    if (!target)\n    {\n        return false;\n    }\n\n    \/\/ \u5934\u90e8\n    if (target == head)\n    {\n        Node* dele = head;\n        head = head->next;\n        free(dele);\n    }\n    \/\/ \u5c3e\u90e8\n    else if (target->next == NULL)\n    {\n        free(target);\n    }\n    \/\/ \u4e2d\u95f4\u8282\u70b9\n    else\n    {\n        Node* target_bf = Get_Idx(head, idx - 1);\n        target_bf->next = target->next;\n        free(target);\n    }\n\n    return true;\n}\n<\/code><\/pre>\n
                    3.2.7 \u6c42\u8868\u957f<\/h4>\n
                    int length(Node* head)\n{\n    Node* poi = head;\n\n    int length = 0;\n\n    while (poi)\n    {\n        length++;\n        poi = poi->next;\n    }\n\n    return length;\n}\n<\/code><\/pre>\n
                    3.3 \u53cc\u94fe\u8868<\/h3>\n
                      \u7ed3\u6784\u8868\u793a\u5982\u4e0b\uff1a<\/p>\n
                    typedef struct dNode\n{\n    elemType data;\n    struct dNnode* prior, next;\n}dNnode;\n<\/code><\/pre>\n
                    3.3.1 \u63d2\u5165<\/h4>\n
                    \/\/ \u73b0\u5728\u6211\u4eec\u8981\u5728prior\u7684\u540e\u9762\u63d2\u5165\u4e00\u4e2a\u5143\u7d20ele\uff0c\u5176\u6307\u9488\u4e3ains\n\/\/ prior\u4e3a\u63d2\u5165\u7684\u76ee\u6807\uff0cnext\u4e3a\u5176\u540e\u7684\u4e00\u4e2a\u6307\u9488\ndNode* prior;\ndNode* next;\ndNode* ins;\n\nins->next = next;\nins->prior = prior;\n\nprior->next = ins;\nnext->prior = ins;\n<\/code><\/pre>\n
                    3.3.1 \u5220\u9664<\/h4>\n
                    \/\/ \u73b0\u5728\u6211\u4eec\u8981\u5220\u9664target\u8282\u70b9\n\/\/ prior\u4e3a\u5176\u524d\u7684\u8282\u70b9\uff0cnext\u4e3a\u5176\u540e\u7684\u8282\u70b9\ndNode* prior;\ndNode* target;\ndNode* next;\n\nprior->next = next;\nnext->prior = prior;\nfree(target);\n<\/code><\/pre>\n
                    3.4 \u5faa\u73af\u94fe\u8868\u548c\u9759\u6001\u94fe\u8868<\/h3>\n
                      \u6ca1\u5565\u597d\u8bf4\u7684\uff0c\u6709\u9898\u96be\u5230\u4e86\u518d\u8865\u5145\u3002<\/p>\n
                    3.5 \u987a\u5e8f\u8868\u548c\u94fe\u8868\u7684\u6bd4\u8f83<\/h3>\n
                    3.5.1 \u5b58\u53d6\u65b9\u5f0f<\/h4>\n
                      \n
                    • \u987a\u5e8f\u8868\uff1a\u987a\u5e8f\u3001\u968f\u673a\u3002<\/li>\n
                    • \u94fe\u8868\uff1a\u987a\u5e8f\u3002<\/li>\n<\/ul>\n
                      3.5.2 \u903b\u8f91\u7ed3\u6784\u4e0e\u7269\u7406\u7ed3\u6784<\/h4>\n
                        \n
                      • \u987a\u5e8f\u8868\uff1a\u903b\u8f91\u76f8\u90bb\u3001\u7269\u7406\u76f8\u90bb\u3002<\/li>\n
                      • \u94fe\u8868\uff1a\u903b\u8f91\u76f8\u90bb\u3002<\/li>\n<\/ul>\n
                        3.5.3 \u67e5\u627e\u3001\u63d2\u5165\u548c\u5220\u9664<\/h4>\n
                          \n
                        • \u6309\u503c\u67e5\u627e\uff1a\u5747\u4e3aO(n)\uff1b\u6ce8\u610f\uff1a\u5bf9\u6709\u5e8f\u987a\u5e8f\u8868\u4f7f\u7528\u6298\u534a\u67e5\u627e\uff0c\u590d\u6742\u5ea6\u4e3aO(log2<\/sub>n)<\/li>\n
                        • \u6309\u5e8f\u53f7\u67e5\u627e\uff1a\u987a\u5e8f\u8868\u4e3aO(1)\uff0c\u94fe\u8868\u4e3aO(n)\u3002<\/li>\n
                        • \u63d2\u5165\u4e0e\u5220\u9664\uff1a\u987a\u5e8f\u8868\u9700\u8981\u79fb\u52a8\u5143\u7d20O(n)\uff0c\u94fe\u8868\u65e0\u9700\u79fb\u52a8O(1)\u3002\u4f46\u662f\u4e24\u8005\u90fd\u9700\u8981\u8003\u8651\u662f\u5426\u67e5\u627e\u8282\u70b9\uff0c\u4ee5\u53ca\u7528\u4f55\u79cd\u65b9\u5f0f\u67e5\u627e\u8282\u70b9\u3002<\/li>\n<\/ul>\n
                          3.5.4 \u7a7a\u95f4\u5206\u914d<\/h4>\n
                            \n
                          • \u987a\u5e8f\u8868\uff1a\u9700\u8981\u9884\u5206\u914d\u5927\u5c0f\uff0c\u5982\u679c\u4f7f\u7528\u52a8\u6001\u5206\u914d\uff0c\u5219\u8981\u6c42\u5185\u5b58\u4e2d\u6709\u8db3\u591f\u5927\u7684\u8fde\u7eed\u7684\u5185\u5b58\u7a7a\u95f4\u652f\u6301\u3002<\/li>\n
                          • \u94fe\u8868\uff1a\u8282\u70b9\u5728\u6dfb\u52a0\u5143\u7d20\u65f6\u7533\u8bf7\uff0c\u65e0\u9700\u8981\u6c42\u8fde\u7eed\u7a7a\u95f4\u3002<\/li>\n<\/ul>\n
                            3.5.5 \u5e94\u7528\u4e2d\u7684\u9009\u62e9<\/h4>\n
                              \n
                            • \u5b58\u50a8\u5bc6\u5ea6\uff1a\u96be\u4ee5\u4f30\u8ba1\u7ebf\u6027\u8868\u7684\u957f\u5ea6\u65f6\u6216\u5b58\u50a8\u89c4\u6a21\u65f6\uff0c\u4e0d\u5b9c\u4f7f\u7528\u7ebf\u6027\u8868\uff1b\u94fe\u8868\u5b58\u50a8\u5bc6\u5ea6\u4f4e\u3002<\/li>\n
                            • \u8fd0\u7b97\uff1a\u9700\u8981\u968f\u673a\u8bbf\u95ee\uff0c\u7ebf\u6027\u8868\uff1b\u9700\u8981\u63d2\u5165\u3001\u5220\u9664\uff0c\u94fe\u8868\u3002<\/li>\n
                            • \u73af\u5883\uff1a\u7ebf\u6027\u8868\u5bb9\u6613\u5b9e\u73b0\uff0c\u94fe\u8868\u5219\u57fa\u4e8e\u6307\u9488\uff0c\u76f8\u5bf9\u96be\u4ee5\u5b9e\u73b0\u3002<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"
                              \u7ebf\u6027\u8868\u987a\u5e8f\u5b58\u50a8\u987a\u5e8f\u8868\u94fe\u5f0f\u5b58\u50a8\u5355\u94fe\u8868\u53cc\u94fe\u8868\u5faa\u73af\u94fe\u8868\u6307\u9488\u5b9e\u73b0\u9759\u6001\u94fe\u8868\uff08\u6570\u7ec4\u5b9e\u73b0\uff09   \u8003\u8bd5\u91cd\u70b9\uff1a\u65f6\u95f4\u590d\u6742\u5ea6\u3001\u7a7a\u95f4\u590d …<\/p>","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[60],"tags":[],"amp_enabled":true,"_links":{"self":[{"href":"https:\/\/swordofmorning.com\/index.php\/wp-json\/wp\/v2\/posts\/600"}],"collection":[{"href":"https:\/\/swordofmorning.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/swordofmorning.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/swordofmorning.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/swordofmorning.com\/index.php\/wp-json\/wp\/v2\/comments?post=600"}],"version-history":[{"count":8,"href":"https:\/\/swordofmorning.com\/index.php\/wp-json\/wp\/v2\/posts\/600\/revisions"}],"predecessor-version":[{"id":608,"href":"https:\/\/swordofmorning.com\/index.php\/wp-json\/wp\/v2\/posts\/600\/revisions\/608"}],"wp:attachment":[{"href":"https:\/\/swordofmorning.com\/index.php\/wp-json\/wp\/v2\/media?parent=600"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/swordofmorning.com\/index.php\/wp-json\/wp\/v2\/categories?post=600"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/swordofmorning.com\/index.php\/wp-json\/wp\/v2\/tags?post=600"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}