{"id":3343,"date":"2025-03-29T17:23:01","date_gmt":"2025-03-29T09:23:01","guid":{"rendered":"https:\/\/www.laixuexila.com\/?p=3343"},"modified":"2025-03-29T17:23:01","modified_gmt":"2025-03-29T09:23:01","slug":"c-stl%ef%bc%88%e6%a0%87%e5%87%86%e6%a8%a1%e6%9d%bf%e5%ba%93%ef%bc%89%e6%95%99%e7%a8%8b","status":"publish","type":"post","link":"https:\/\/www.laixuexila.com\/index.php\/2025\/03\/29\/c-stl%ef%bc%88%e6%a0%87%e5%87%86%e6%a8%a1%e6%9d%bf%e5%ba%93%ef%bc%89%e6%95%99%e7%a8%8b\/","title":{"rendered":"C++ STL\uff08\u6807\u51c6\u6a21\u677f\u5e93\uff09\u6559\u7a0b"},"content":{"rendered":"\n

C++ \u6807\u51c6\u6a21\u677f\u5e93\uff08STL\uff0cStandard Template Library\uff09\u662f C++ \u63d0\u4f9b\u7684\u4e00\u5957\u5f3a\u5927\u7684\u6570\u636e\u7ed3\u6784\u548c\u7b97\u6cd5\u5e93\uff0c\u4e3b\u8981\u5305\u542b\u4e09\u5927\u7ec4\u4ef6\uff1a<\/p>\n\n\n\n

    \n
  1. \u5bb9\u5668\uff08Containers\uff09<\/strong>\uff1a\u5b58\u50a8\u6570\u636e\u7684\u5bb9\u5668\uff0c\u5982\u6570\u7ec4\u3001\u94fe\u8868\u3001\u96c6\u5408\u7b49\u3002<\/li>\n\n\n\n
  2. \u7b97\u6cd5\uff08Algorithms\uff09<\/strong>\uff1a\u7528\u4e8e\u64cd\u4f5c\u5bb9\u5668\u7684\u7b97\u6cd5\uff0c\u5982\u6392\u5e8f\u3001\u67e5\u627e\u3001\u4fee\u6539\u7b49\u3002<\/li>\n\n\n\n
  3. \u8fed\u4ee3\u5668\uff08Iterators\uff09<\/strong>\uff1a\u7528\u4e8e\u8bbf\u95ee\u5bb9\u5668\u5143\u7d20\u7684\u5de5\u5177\uff0c\u53ef\u4ee5\u50cf\u6307\u9488\u4e00\u6837\u64cd\u4f5c\u5bb9\u5668\u4e2d\u7684\u5143\u7d20\u3002<\/li>\n<\/ol>\n\n\n\n

    C++ STL \u63d0\u4f9b\u4e86\u6a21\u677f\u7c7b\u548c\u6a21\u677f\u51fd\u6570\uff0c\u80fd\u591f\u4f7f\u6211\u4eec\u7f16\u5199\u51fa\u9ad8\u6548\u4e14\u53ef\u590d\u7528\u7684\u4ee3\u7801\u3002\u63a5\u4e0b\u6765\u5c06\u4ecb\u7ecd C++ STL \u7684\u57fa\u672c\u7528\u6cd5\u3002<\/p>\n\n\n\n

    \n\n\n\n

    1. \u5bb9\u5668\uff08Containers\uff09<\/strong><\/h2>\n\n\n\n

    STL \u63d0\u4f9b\u4e86\u591a\u79cd\u5bb9\u5668\uff0c\u5206\u4e3a\u987a\u5e8f\u5bb9\u5668\u548c\u5173\u8054\u5bb9\u5668\u3002<\/p>\n\n\n\n

    1.1 \u987a\u5e8f\u5bb9\u5668<\/strong><\/h3>\n\n\n\n

    \u987a\u5e8f\u5bb9\u5668\u7528\u4e8e\u5b58\u50a8\u6709\u5e8f\u7684\u6570\u636e\uff0c\u5bb9\u5668\u4e2d\u7684\u5143\u7d20\u6309\u7167\u63d2\u5165\u987a\u5e8f\u8fdb\u884c\u5b58\u50a8\u3002\u5e38\u89c1\u7684\u987a\u5e8f\u5bb9\u5668\u6709\uff1a<\/p>\n\n\n\n

      \n
    • vector<\/strong>\uff1a\u52a8\u6001\u6570\u7ec4\u3002<\/li>\n\n\n\n
    • list<\/strong>\uff1a\u53cc\u5411\u94fe\u8868\u3002<\/li>\n\n\n\n
    • deque<\/strong>\uff1a\u53cc\u7aef\u961f\u5217\u3002<\/li>\n\n\n\n
    • array<\/strong>\uff1a\u56fa\u5b9a\u5927\u5c0f\u6570\u7ec4\u3002<\/li>\n<\/ul>\n\n\n\n

      vector<\/strong><\/h4>\n\n\n\n

      vector<\/code> \u662f\u4e00\u79cd\u52a8\u6001\u6570\u7ec4\u5bb9\u5668\uff0c\u80fd\u591f\u81ea\u52a8\u8c03\u6574\u5927\u5c0f\uff0c\u652f\u6301\u968f\u673a\u8bbf\u95ee\u5143\u7d20\u3002<\/p>\n\n\n\n

      #include <iostream>\n#include <vector>\n\nint main() {\n    std::vector<int> v = {1, 2, 3, 4, 5};\n\n    \/\/ \u8f93\u51fa vector \u4e2d\u7684\u5143\u7d20\n    for (int num : v) {\n        std::cout << num << \" \";\n    }\n    std::cout << std::endl;\n\n    \/\/ \u6dfb\u52a0\u5143\u7d20\n    v.push_back(6);\n    std::cout << \"After push_back(6): \";\n    for (int num : v) {\n        std::cout << num << \" \";\n    }\n    std::cout << std::endl;\n\n    \/\/ \u8bbf\u95ee\u5143\u7d20\n    std::cout << \"Element at index 2: \" << v[2] << std::endl;\n\n    return 0;\n}<\/code><\/pre>\n\n\n\n
      list<\/strong><\/h4>\n\n\n\n
      list<\/code> \u662f\u4e00\u4e2a\u53cc\u5411\u94fe\u8868\uff0c\u652f\u6301\u9ad8\u6548\u7684\u5143\u7d20\u63d2\u5165\u548c\u5220\u9664\u3002<\/p>\n\n\n\n
      #include <iostream>\n#include <list>\n\nint main() {\n    std::list<int> l = {1, 2, 3, 4, 5};\n\n    \/\/ \u8f93\u51fa list \u4e2d\u7684\u5143\u7d20\n    for (int num : l) {\n        std::cout << num << \" \";\n    }\n    std::cout << std::endl;\n\n    \/\/ \u6dfb\u52a0\u5143\u7d20\n    l.push_back(6);\n    l.push_front(0);\n    std::cout << \"After push_back(6) and push_front(0): \";\n    for (int num : l) {\n        std::cout << num << \" \";\n    }\n    std::cout << std::endl;\n\n    return 0;\n}<\/code><\/pre>\n\n\n\n
      deque<\/strong><\/h4>\n\n\n\n
      deque<\/code> \u662f\u4e00\u4e2a\u53cc\u7aef\u961f\u5217\uff0c\u5141\u8bb8\u5728\u4e24\u7aef\u63d2\u5165\u548c\u5220\u9664\u5143\u7d20\u3002<\/p>\n\n\n\n
      #include <iostream>\n#include <deque>\n\nint main() {\n    std::deque<int> dq = {1, 2, 3, 4, 5};\n\n    \/\/ \u8f93\u51fa deque \u4e2d\u7684\u5143\u7d20\n    for (int num : dq) {\n        std::cout << num << \" \";\n    }\n    std::cout << std::endl;\n\n    \/\/ \u6dfb\u52a0\u5143\u7d20\n    dq.push_back(6);\n    dq.push_front(0);\n    std::cout << \"After push_back(6) and push_front(0): \";\n    for (int num : dq) {\n        std::cout << num << \" \";\n    }\n    std::cout << std::endl;\n\n    return 0;\n}<\/code><\/pre>\n\n\n\n
      array<\/strong><\/h4>\n\n\n\n
      array<\/code> \u662f\u4e00\u4e2a\u56fa\u5b9a\u5927\u5c0f\u7684\u6570\u7ec4\u5bb9\u5668\uff0c\u5927\u5c0f\u5728\u7f16\u8bd1\u65f6\u51b3\u5b9a\uff0c\u9002\u7528\u4e8e\u5927\u5c0f\u5df2\u77e5\u4e14\u56fa\u5b9a\u7684\u5bb9\u5668\u3002<\/p>\n\n\n\n
      #include <iostream>\n#include <array>\n\nint main() {\n    std::array<int, 5> arr = {1, 2, 3, 4, 5};\n\n    \/\/ \u8f93\u51fa array \u4e2d\u7684\u5143\u7d20\n    for (int num : arr) {\n        std::cout << num << \" \";\n    }\n    std::cout << std::endl;\n\n    return 0;\n}<\/code><\/pre>\n\n\n\n
      \n\n\n\n
      1.2 \u5173\u8054\u5bb9\u5668<\/strong><\/h3>\n\n\n\n
      \u5173\u8054\u5bb9\u5668\u6839\u636e\u5143\u7d20\u7684\u952e\u503c\u8fdb\u884c\u5b58\u50a8\uff0c\u652f\u6301\u5feb\u901f\u67e5\u627e\u64cd\u4f5c\u3002\u5e38\u89c1\u7684\u5173\u8054\u5bb9\u5668\u6709\uff1a<\/p>\n\n\n\n
        \n
      • set<\/strong>\uff1a\u96c6\u5408\uff0c\u5b58\u50a8\u552f\u4e00\u5143\u7d20\u3002<\/li>\n\n\n\n
      • map<\/strong>\uff1a\u6620\u5c04\uff0c\u5b58\u50a8\u952e\u503c\u5bf9\u3002<\/li>\n\n\n\n
      • unordered_set<\/strong>\uff1a\u65e0\u5e8f\u96c6\u5408\u3002<\/li>\n\n\n\n
      • unordered_map<\/strong>\uff1a\u65e0\u5e8f\u6620\u5c04\u3002<\/li>\n<\/ul>\n\n\n\n
        set<\/strong><\/h4>\n\n\n\n
        set<\/code> \u662f\u4e00\u4e2a\u96c6\u5408\u5bb9\u5668\uff0c\u81ea\u52a8\u6392\u5e8f\u5e76\u4e14\u4e0d\u5141\u8bb8\u91cd\u590d\u5143\u7d20\u3002<\/p>\n\n\n\n
        #include <iostream>\n#include <set>\n\nint main() {\n    std::set<int> s = {5, 1, 3, 4, 2};\n\n    \/\/ \u8f93\u51fa set \u4e2d\u7684\u5143\u7d20\n    for (int num : s) {\n        std::cout << num << \" \";\n    }\n    std::cout << std::endl;\n\n    return 0;\n}<\/code><\/pre>\n\n\n\n
        map<\/strong><\/h4>\n\n\n\n
        map<\/code> \u662f\u4e00\u4e2a\u952e\u503c\u5bf9\u5bb9\u5668\uff0c\u5176\u4e2d\u7684\u952e\u662f\u552f\u4e00\u7684\uff0c\u6309\u952e\u81ea\u52a8\u6392\u5e8f\u3002<\/p>\n\n\n\n
        #include <iostream>\n#include <map>\n\nint main() {\n    std::map<int, std::string> m = {{1, \"one\"}, {2, \"two\"}, {3, \"three\"}};\n\n    \/\/ \u8f93\u51fa map \u4e2d\u7684\u952e\u503c\u5bf9\n    for (const auto &pair : m) {\n        std::cout << pair.first << \": \" << pair.second << std::endl;\n    }\n\n    return 0;\n}<\/code><\/pre>\n\n\n\n
        \n\n\n\n
        2. \u7b97\u6cd5\uff08Algorithms\uff09<\/strong><\/h2>\n\n\n\n
        STL \u63d0\u4f9b\u4e86\u8bb8\u591a\u7528\u4e8e\u64cd\u4f5c\u5bb9\u5668\u7684\u7b97\u6cd5\uff0c\u5982\u6392\u5e8f\u3001\u67e5\u627e\u3001\u4fee\u6539\u7b49\u3002\u5e38\u7528\u7684\u7b97\u6cd5\u5305\u62ec\uff1a<\/p>\n\n\n\n
          \n
        • sort<\/strong>\uff1a\u6392\u5e8f\u3002<\/li>\n\n\n\n
        • find<\/strong>\uff1a\u67e5\u627e\u5143\u7d20\u3002<\/li>\n\n\n\n
        • reverse<\/strong>\uff1a\u53cd\u8f6c\u5bb9\u5668\u3002<\/li>\n\n\n\n
        • accumulate<\/strong>\uff1a\u7d2f\u52a0\u5bb9\u5668\u4e2d\u7684\u5143\u7d20\u3002<\/li>\n<\/ul>\n\n\n\n
          2.1 sort<\/strong><\/h3>\n\n\n\n
          #include <iostream>\n#include <vector>\n#include <algorithm>\n\nint main() {\n    std::vector<int> v = {5, 3, 4, 1, 2};\n\n    \/\/ \u6392\u5e8f\n    std::sort(v.begin(), v.end());\n\n    \/\/ \u8f93\u51fa\u6392\u5e8f\u540e\u7684\u5143\u7d20\n    for (int num : v) {\n        std::cout << num << \" \";\n    }\n    std::cout << std::endl;\n\n    return 0;\n}<\/code><\/pre>\n\n\n\n
          2.2 find<\/strong><\/h3>\n\n\n\n
          #include <iostream>\n#include <vector>\n#include <algorithm>\n\nint main() {\n    std::vector<int> v = {5, 3, 4, 1, 2};\n\n    \/\/ \u67e5\u627e\u5143\u7d20\n    auto it = std::find(v.begin(), v.end(), 4);\n    if (it != v.end()) {\n        std::cout << \"Element found: \" << *it << std::endl;\n    } else {\n        std::cout << \"Element not found!\" << std::endl;\n    }\n\n    return 0;\n}<\/code><\/pre>\n\n\n\n
          2.3 reverse<\/strong><\/h3>\n\n\n\n
          #include <iostream>\n#include <vector>\n#include <algorithm>\n\nint main() {\n    std::vector<int> v = {1, 2, 3, 4, 5};\n\n    \/\/ \u53cd\u8f6c\u5bb9\u5668\n    std::reverse(v.begin(), v.end());\n\n    \/\/ \u8f93\u51fa\u53cd\u8f6c\u540e\u7684\u5143\u7d20\n    for (int num : v) {\n        std::cout << num << \" \";\n    }\n    std::cout << std::endl;\n\n    return 0;\n}<\/code><\/pre>\n\n\n\n
          \n\n\n\n
          3. \u8fed\u4ee3\u5668\uff08Iterators\uff09<\/strong><\/h2>\n\n\n\n
          STL \u7684\u8fed\u4ee3\u5668\u7c7b\u4f3c\u4e8e\u6307\u9488\uff0c\u5141\u8bb8\u6211\u4eec\u904d\u5386\u5bb9\u5668\u4e2d\u7684\u5143\u7d20\u3002\u5e38\u89c1\u7684\u8fed\u4ee3\u5668\u64cd\u4f5c\u6709\uff1a<\/p>\n\n\n\n
            \n
          • begin()<\/strong>\uff1a\u8fd4\u56de\u5bb9\u5668\u7684\u7b2c\u4e00\u4e2a\u5143\u7d20\u7684\u8fed\u4ee3\u5668\u3002<\/li>\n\n\n\n
          • end()<\/strong>\uff1a\u8fd4\u56de\u5bb9\u5668\u7684\u6700\u540e\u4e00\u4e2a\u5143\u7d20\u7684\u4e0b\u4e00\u4e2a\u4f4d\u7f6e\u7684\u8fed\u4ee3\u5668\u3002<\/li>\n\n\n\n
          • rbegin()<\/strong>\uff1a\u8fd4\u56de\u5bb9\u5668\u7684\u53cd\u5411\u8fed\u4ee3\u5668\uff0c\u6307\u5411\u6700\u540e\u4e00\u4e2a\u5143\u7d20\u3002<\/li>\n\n\n\n
          • rend()<\/strong>\uff1a\u8fd4\u56de\u5bb9\u5668\u7684\u53cd\u5411\u8fed\u4ee3\u5668\uff0c\u6307\u5411\u7b2c\u4e00\u4e2a\u5143\u7d20\u7684\u524d\u4e00\u4e2a\u4f4d\u7f6e\u3002<\/li>\n<\/ul>\n\n\n\n
            3.1 \u4f7f\u7528\u8fed\u4ee3\u5668\u904d\u5386\u5bb9\u5668<\/strong><\/h3>\n\n\n\n
            #include <iostream>\n#include <vector>\n\nint main() {\n    std::vector<int> v = {1, 2, 3, 4, 5};\n\n    \/\/ \u4f7f\u7528\u8fed\u4ee3\u5668\u904d\u5386\u5bb9\u5668\n    for (auto it = v.begin(); it != v.end(); ++it) {\n        std::cout << *it << \" \";\n    }\n    std::cout << std::endl;\n\n    return 0;\n}<\/code><\/pre>\n\n\n\n
            \n\n\n\n
            4. \u603b\u7ed3<\/strong><\/h2>\n\n\n\n
            STL \u63d0\u4f9b\u4e86\u5f3a\u5927\u7684\u5bb9\u5668\u3001\u7b97\u6cd5\u548c\u8fed\u4ee3\u5668\uff0c\u6781\u5927\u5730\u7b80\u5316\u4e86 C++ \u7f16\u7a0b\u3002\u901a\u8fc7\u4f7f\u7528 STL\uff0c\u53ef\u4ee5\u66f4\u9ad8\u6548\u5730\u5b9e\u73b0\u5e38\u89c1\u7684\u6570\u636e\u7ed3\u6784\u64cd\u4f5c\u548c\u7b97\u6cd5\u3002\u638c\u63e1 STL \u662f C++ \u7f16\u7a0b\u7684\u91cd\u8981\u57fa\u7840\u3002<\/p>\n","protected":false},"excerpt":{"rendered":"
            C++ \u6807\u51c6\u6a21\u677f\u5e93\uff08STL\uff0cStandard Template Library\uff09\u662f C++ \u63d0\u4f9b\u7684\u4e00\u5957\u5f3a\u5927\u7684\u6570 […]<\/p>\n","protected":false},"author":1,"featured_media":3344,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[81],"tags":[],"class_list":["post-3343","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-c-"],"_links":{"self":[{"href":"https:\/\/www.laixuexila.com\/index.php\/wp-json\/wp\/v2\/posts\/3343","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.laixuexila.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.laixuexila.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.laixuexila.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.laixuexila.com\/index.php\/wp-json\/wp\/v2\/comments?post=3343"}],"version-history":[{"count":1,"href":"https:\/\/www.laixuexila.com\/index.php\/wp-json\/wp\/v2\/posts\/3343\/revisions"}],"predecessor-version":[{"id":3345,"href":"https:\/\/www.laixuexila.com\/index.php\/wp-json\/wp\/v2\/posts\/3343\/revisions\/3345"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.laixuexila.com\/index.php\/wp-json\/wp\/v2\/media\/3344"}],"wp:attachment":[{"href":"https:\/\/www.laixuexila.com\/index.php\/wp-json\/wp\/v2\/media?parent=3343"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.laixuexila.com\/index.php\/wp-json\/wp\/v2\/categories?post=3343"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.laixuexila.com\/index.php\/wp-json\/wp\/v2\/tags?post=3343"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}