{"id":246,"date":"2026-01-12T16:57:00","date_gmt":"2026-01-12T08:57:00","guid":{"rendered":"https:\/\/jiangqvweihuan.cn\/?p=246"},"modified":"2026-01-13T12:28:11","modified_gmt":"2026-01-13T04:28:11","slug":"%e7%ae%97%e6%b3%95%e8%b1%a1%e9%99%90%c2%b7%e6%9f%a5%e6%89%be%e7%b1%bb%e7%ae%97%e6%b3%95","status":"publish","type":"post","link":"https:\/\/jiangqvweihuan.cn\/index.php\/2026\/01\/12\/%e7%ae%97%e6%b3%95%e8%b1%a1%e9%99%90%c2%b7%e6%9f%a5%e6%89%be%e7%b1%bb%e7%ae%97%e6%b3%95\/","title":{"rendered":"\u7b97\u6cd5\u8c61\u9650\u00b7\u67e5\u627e\u7c7b\u7b97\u6cd5"},"content":{"rendered":"\n

\u6b64\u7cfb\u5217\u7528\u4e8e\u4ecb\u7ecdSTL\u5e93\u4e2dalgorithm\u4e2d\u6240\u6709\u7ade\u8d5b\u5e38\u7528\u7684\u7b97\u6cd5\uff0c\u65b9\u4fbf\u5927\u5bb6\u7ade\u8d5b\u4e2d\u53ef\u4ee5\u5feb\u901f\u7684\u5b9e\u73b0\u67d0\u4e2a\u529f\u80fd\uff0c\u5efa\u8bae\u5927\u5bb6\u8981\u540c\u6b65\u8ddf\u7740\u6572\u5199\u4ee3\u7801\u8054\u7cfb\u529f\u80fd\u3002<\/p>\n\n\n\n

\u4e00\u3001\u57fa\u7840\u67e5\u627e<\/h2>\n\n\n\n

1.find\uff08\u57fa\u7840\u7ebf\u6027\u67e5\u627e\uff09<\/h3>\n\n\n\n
    int a[105];\n    vector<int> b;\n    for (int i = 1; i <= 100; ++i)\n    {\n        a[i] = i + 5;\n        b.push_back(a[i]);\n    }\n    auto it = find(begin(a), end(a), 1000);\n    auto ti = find(b.begin(), b.end(), 10);\n    if (it != end(a)) \/\/ \u56e0\u4e3aa\u4e2d\u4e0d\u5b58\u57281000\uff0c\u6545\u4e0d\u6267\u884c\n    {\n        int index = it - begin(a);\n        cout << \"a\u4e0b\u6807: \" << index << endl;\n    }\n    if (ti != b.end())\n    {\n        int pos = ti - b.begin();\n        \/\/\u4e5f\u53ef\u5199\u4e3aint pos = distance(b.begin(), ti)\uff0c\u8fed\u4ee3\u5668\u4e13\u9898\u518d\u7ec6\u8bb2\n        cout << pos << endl  \/\/\u8f93\u51fa\u4e0b\u6807\n             << *ti << endl; \/\/\u8f93\u51fa\u503c\n    }\n    cout << end(a) << endl\n         << it << endl; \/\/ \u9a8c\u8bc1\u67e5\u8be2\u4e0d\u7740\u8fd4\u56de\u7684\u7ed3\u679c\u662f\u5bf9\u5e94\u5426\u4e3aend(a)<\/code><\/pre>\n\n\n\n
find\u8d77\u5230\u5f88\u7b80\u5355\u7684\u4e00\u4e2a\u67e5\u8be2\uff0cfind\uff08\u67e5\u8be2\u8d77\u59cb\u4f4d\u7f6e\u6307\u9488\uff0c\u67e5\u8be2\u7ed3\u675f\u4f4d\u7f6e\u6307\u9488\uff0c\u67e5\u627e\u503c\uff09;\u9700\u8981\u6570\u4ee5\u7684\u662f\uff0c\u63d2\u53d9\u7684\u533a\u95f4\u662f\u5de6\u95ed\u53f3\u5f00\u7684\uff0c\u56e0\u6b64\u5c31\u7b97end(a)\u8fd4\u56de\u7684\u662f\u6700\u540e\u4e00\u4f4d\u5143\u7d20\u7684\u4e0b\u4e00\u4e2a\u4f4d\u7f6e\u7684\u6307\u9488\u4f9d\u65e7\u53ef\u4ee5\u6267\u884c\uff0c\u5e76\u4e0d\u4f1a\u51fa\u73b0\u7f16\u8bd1\u95ee\u9898\u3002<\/p>\n\n\n\n
\u81f3\u4e8eend(a)\u548ca.end()\u7684\u533a\u522b\uff0c\u6211\u5728\u8fd9\u7b80\u5355\u63d0\u4e00\u4e0b\uff0ca.end()\u5c5e\u4e8e\u7279\u5f02\u5316\u63a5\u53e3\uff0c\u5bf9\u4e8e\u50cfvector\u5bb9\u5668\u4e0edeque\u5bb9\u5668\u800c\u8a00\u662f\u6210\u5458\u51fd\u6570\uff0c\u800cend(a)\u662fc++\u6240\u63d0\u4f9b\u7684\u901a\u7528\u63a5\u53e3\uff0c\u6027\u80fd\u5b8c\u5168\u76f8\u540c\u4e14\u652f\u6301\u9759\u6001\u6570\u7ec4\uff0c\u5982\u679c\u9759\u6001\u6570\u7ec4\u7528a\u3002end()\u5219\u4f1a\u51fa\u73b0\u7f16\u8bd1\u9519\u8bef\uff0c\u7b97\u6cd5\u7ade\u8d5b\u4e2d\u5e38\u7528\u540e\u8005\uff0c\u6211\u4eec\u53ef\u4ee5\u6839\u636e\u81ea\u5df1\u559c\u597d\u81ea\u884c\u8c03\u6574\u3002<\/p>\n\n\n\n
2.count\uff08\u57fa\u7840\u7ebf\u6027\u6280\u8ba1\u6570\uff09<\/h3>\n\n\n\n
    \/\/ \u5bf9\u4e8e\u5bb9\u5668\u4f7f\u7528count\u7684\u65b9\u6cd5\n    vector<int> nums = {1, 2, 3, 2, 4, 2, 5};\n    int target1 = 2;\n    \/\/ \u7edf\u8ba1 nums \u4e2d 2 \u51fa\u73b0\u7684\u6b21\u6570\n    int cnt1 = count(nums.begin(), nums.end(), target1);\n    cout << \"\u6570\u5b57 \" << target1 << \" \u51fa\u73b0\u4e86 \" << cnt1 << \" \u6b21\" << endl;\n    \/\/ \u8f93\u51fa\uff1a\u6570\u5b57 2 \u51fa\u73b0\u4e86 3 \u6b21\n\n    \/\/ \u5bf9\u4e8e\u6570\u7ec4\u4f7f\u7528count\u7684\u65b9\u6cd5\n    int arr[] = {5, 3, 5, 7, 5, 9};\n    int n = sizeof(arr) \/ sizeof(arr[0]); \/\/ \u6216\u8005int n = arr.size();\n    \/\/ \u6570\u7ec4\u957f\u5ea6\n    int target2 = 5;\n    \/\/ \u7edf\u8ba1\u6570\u7ec4\u4e2d 5 \u51fa\u73b0\u7684\u6b21\u6570\uff08\u7528\u6307\u9488\u4f5c\u4e3a\u8fed\u4ee3\u5668\uff09\n    int cnt2 = count(arr, begin(arr) + n, target2);\n    \/\/ \u540cint cnt = count(begin(arr), end(arr), target);\n    cout << \"\u6570\u5b57 \" << target2 << \" \u51fa\u73b0\u4e86 \" << cnt2 << \" \u6b21\" << endl;\n    \/\/ \u8f93\u51fa\uff1a\u6570\u5b57 5 \u51fa\u73b0\u4e86 3 \u6b21\n\n    \/\/\u5bf9\u4e8e\u5b57\u7b26\u4e32\u4f7f\u7528count\u7684\u65b9\u6cd5\n    string s = \"hello world\";\n    char target3 = 'l';\n    \/\/ \u7edf\u8ba1\u5b57\u7b26\u4e32\u4e2d 'l' \u51fa\u73b0\u7684\u6b21\u6570\n    int cnt3 = count(s.begin(), s.end(), target3);\n    cout << \"\u5b57\u7b26 '\" << target3 << \"' \u51fa\u73b0\u4e86 \" << cnt3 << \" \u6b21\" << endl;\n    \/\/ \u8f93\u51fa\uff1a\u5b57\u7b26 'l' \u51fa\u73b0\u4e86 3 \u6b21<\/code><\/pre>\n\n\n\n
count\u51fd\u6570\u7684\u5185\u90e8\u903b\u8f91\u5176\u5b9e\u5f88\u7b80\u5355\uff0c\u76f8\u5f53\u4e8e\u4e00\u4e2a\u300c\u81ea\u52a8\u5faa\u73af\u8ba1\u6570\u300d\u7684\u8fc7\u7a0b\uff1a<\/p>\n\n\n\n
    \n
  1. \u4ece first \u8fed\u4ee3\u5668\u5f00\u59cb\uff0c\u904d\u5386\u5230 last \u8fed\u4ee3\u5668\uff08\u4e0d\u5305\u542b last \u6307\u5411\u7684\u4f4d\u7f6e\uff09\u3002<\/li>\n\n\n\n
  2. \u6bcf\u9047\u5230\u4e00\u4e2a\u4e0e value \u76f8\u7b49\u7684\u5143\u7d20\uff0c\u5c31\u5c06\u8ba1\u6570\u52a0 1\u3002<\/li>\n\n\n\n
  3. \u904d\u5386\u7ed3\u675f\u540e\uff0c\u8fd4\u56de\u603b\u8ba1\u6570\u3002<\/li>\n<\/ol>\n\n\n\n
    \u7c7b\u4f3c\u4e8e\u4ee5\u4e0b\u7684\u5faa\u73af\u7ed3\u6784\uff1a<\/p>\n\n\n\n
        \/\/ \u624b\u52a8\u6a21\u62df count \u51fd\u6570\u7684\u903b\u8f91\n    int manual_count(vector<int> &nums,int value)\n    {\n        int cnt = 0;\n        for (int x : nums)\n        {\n            if (x == value)\n                cnt++;\n        }\n        return cnt;\n    }<\/code><\/pre>\n\n\n\n
    \u4ee3\u7801\u5f88\u597d\u7406\u89e3\uff0c\u521a\u597d\u6211\u4eec\u5c31\u4e0a\u9762vector<int> &nums\u8bb2\u4e00\u4e0b\u5982\u679c\u6211\u4eec\u6539\u4e3avector<int> nums\u4f1a\u51fa\u73b0\u4ec0\u4e48\u4e0d\u540c\u5417\uff1f\u7b54\u6848\u662f\u5e76\u4e0d\u4f1a\uff0c\u6211\u4eec\u5206\u6790\u4e00\u4e0b\uff1a<\/p>\n\n\n\n
    &\u5728\u53c2\u6570\u4e2d\u8868\u793a\u5f15\u7528\u4f20\u9012<\/strong>\uff0c\u51fd\u6570\u5185\u64cd\u4f5c\u7684\u662f\u539f\u59cb\u6570\u636e\u7684\u76f4\u63a5\u5f15\u7528\uff0c\u4fee\u6539\u4f1a\u5f71\u54cd\u539f\u53d8\u91cf\u3002\u6ca1\u6709&\u662f\u503c\u4f20\u9012<\/strong>\uff0c\u51fd\u6570\u63a5\u6536\u7684\u662f\u6570\u636e\u7684\u72ec\u7acb\u526f\u672c\uff0c\u4fee\u6539\u4e0d\u4f1a\u5f71\u54cd\u539f\u59cb\u6570\u636e\u3002\u5bf9\u4e8emanual_count\u51fd\u6570\uff0c\u4f7f\u7528vector<int> &nums\u5141\u8bb8\u4f46\u4e0d\u5f3a\u5236\u4fee\u6539<\/strong>\u539f\u59cb\u6570\u636e\uff0c\u800c\u5b9e\u9645\u4ee3\u7801\u4e2d\u5e76\u672a\u4fee\u6539\uff1b\u5982\u679c\u6539\u4e3avector<int> nums\u4f1a\u989d\u5916\u590d\u5236\u6574\u4e2a\u6570\u7ec4<\/strong>\uff0c\u6027\u80fd\u8f83\u5dee\u4f46\u884c\u4e3a\u4e00\u81f4\uff08\u56e0\u4e3a\u53ea\u8bfb\u53d6\uff09\uff0c\u56e0\u6b64\uff0c\u4e00\u822c\u60c5\u51b5\u4e0b\u6211\u4eec\u7684\u53ea\u8bfb\u503c\u4f20\u9012\u91c7\u53d6const vector<int> &nums\u66f4\u52a0\u4e13\u4e1a\u3002<\/p>\n\n\n\n
    \u4e8c\u3001\u6761\u4ef6\u67e5\u627e<\/h2>\n\n\n\n
    1.find_if<\/h3>\n\n\n\n
    \u548c find\u51fd\u6570\u76f8\u540c\uff0cfind_if\u51fd\u6570\u4e5f\u7528\u4e8e\u5728\u6307\u5b9a\u533a\u57df\u5185\u6267\u884c\u67e5\u627e\u64cd\u4f5c\u3002\u4e0d\u540c\u7684\u662f\uff0c\u524d\u8005\u9700\u8981\u660e\u786e\u6307\u5b9a\u8981\u67e5\u627e\u7684\u5143\u7d20\u7684\u503c\uff0c\u800c\u540e\u8005\u5219\u5141\u8bb8\u81ea\u5b9a\u4e49\u67e5\u627e\u89c4\u5219\u3002<\/p>\n\n\n\n
    \u81ea\u5b9a\u4e49\u67e5\u627e\u89c4\u5219\uff0c\u5b9e\u9645\u4e0a\u6307\u7684\u662f\u6709\u4e00\u4e2a\u5f62\u53c2\u4e14\u8fd4\u56de\u503c\u7c7b\u578b\u4e3a bool \u7684\u51fd\u6570\u3002\u503c\u5f97\u4e00\u63d0\u7684\u662f\uff0c\u8be5\u51fd\u6570\u53ef\u4ee5\u662f\u4e00\u4e2a\u666e\u901a\u51fd\u6570\uff08\u53c8\u79f0\u4e3a\u4e00\u5143\u8c13\u8bcd\u51fd\u6570\uff09\uff0c\u6bd4\u5982\uff1a<\/p>\n\n\n\n
    bool cmp(int i) {\n  return ((i%2)==1);\n}<\/code><\/pre>\n\n\n\n
    \u4e0a\u9762\u7684 cmp\u5c31\u662f\u4e00\u4e2a\u4e00\u5143\u8c13\u8bcd\u51fd\u6570\uff0c\u5176\u53ef\u7528\u6765\u5224\u65ad\u4e00\u4e2a\u6574\u6570\u662f\u5947\u6570\u8fd8\u662f\u5076\u6570\u3002<\/p>\n\n\n\n
    \u786e\u5207\u5730\u8bf4\uff0cfind_if\u51fd\u6570\u4f1a\u6839\u636e\u6307\u5b9a\u7684\u67e5\u627e\u89c4\u5219\uff0c\u5728\u6307\u5b9a\u533a\u57df\u5185\u67e5\u627e\u7b2c\u4e00\u4e2a\u7b26\u5408\u8be5\u51fd\u6570\u8981\u6c42\uff08\u4f7f\u51fd\u6570\u8fd4\u56de true\uff09\u7684\u5143\u7d20\u3002<\/p>\n\n\n\n
    find_if() \u51fd\u6570\u7684\u8bed\u6cd5\u683c\u5f0f\u5982\u4e0b\uff1a<\/p>\n\n\n\n
    InputIterator find_if (InputIterator first, InputIterator last, UnaryPredicate pred);<\/p>\n\n\n\n
    \u5176\u4e2d\uff0cfirst \u548c last \u90fd\u4e3a\u8f93\u5165\u8fed\u4ee3\u5668\uff0c\u5176\u7ec4\u5408 [first, last) \u7528\u4e8e\u6307\u5b9a\u8981\u67e5\u627e\u7684\u533a\u57df\uff1bpred \u7528\u4e8e\u81ea\u5b9a\u4e49\u67e5\u627e\u89c4\u5219\u3002\u503c\u5f97\u4e00\u63d0\u7684\u662f\uff0c\u7531\u4e8e first \u548c last \u90fd\u4e3a\u8f93\u5165\u8fed\u4ee3\u5668\uff0c\u610f\u5473\u7740\u8be5\u51fd\u6570\u9002\u7528\u4e8e\u6240\u6709\u7684\u5e8f\u5217\u5f0f\u5bb9\u5668\u3002\u751a\u81f3\u5f53\u91c7\u7528\u9002\u5f53\u7684\u8c13\u8bcd\u51fd\u6570\u65f6\uff0c\u8be5\u51fd\u6570\u8fd8\u9002\u7528\u4e8e\u6240\u6709\u7684\u5173\u8054\u5f0f\u5bb9\u5668\uff08\u5305\u62ec\u54c8\u5e0c\u5bb9\u5668\uff09\u3002<\/p>\n\n\n\n
    \u540c\u65f6\uff0c\u8be5\u51fd\u6570\u4f1a\u8fd4\u56de\u4e00\u4e2a\u8f93\u5165\u8fed\u4ee3\u5668\uff0c\u5f53\u67e5\u627e\u6210\u529f\u65f6\uff0c\u8be5\u8fed\u4ee3\u5668\u6307\u5411\u7684\u662f\u7b2c\u4e00\u4e2a\u7b26\u5408\u67e5\u627e\u89c4\u5219\u7684\u5143\u7d20\uff1b\u53cd\u4e4b\uff0c\u5982\u679c find_if() \u51fd\u6570\u67e5\u627e\u5931\u8d25\uff0c\u5219\u8be5\u8fed\u4ee3\u5668\u7684\u6307\u5411\u548c last \u8fed\u4ee3\u5668\u76f8\u540c\u3002<\/p>\n\n\n\n
    \u5177\u4f53\u793a\u4f8b\u5982\u4e0b\uff1a<\/p>\n\n\n\n
    #include <iostream>     \/\/ std::cout\n#include <algorithm>    \/\/ std::find_if\n#include <vector>       \/\/ std::vector\nusing namespace std;\n\/\/\u81ea\u5b9a\u4e49\u4e00\u5143\u8c13\u8bcd\u51fd\u6570\nbool mycomp(int i) {\n    return ((i % 2) == 1);\n}\n\/\/\u4ee5\u51fd\u6570\u5bf9\u8c61\u7684\u5f62\u5f0f\u5b9a\u4e49\u4e00\u4e2a find_if() \u51fd\u6570\u7684\u67e5\u627e\u89c4\u5219\nclass mycomp2 {\npublic:\n    bool operator()(const int& i) {\n        return ((i % 2) == 1);\n    }\n};\nint main() {\n    vector<int> myvector{ 4,2,3,1,5 };\n    \/\/\u8c03\u7528 find_if() \u51fd\u6570\uff0c\u5e76\u4ee5 IsOdd() \u4e00\u5143\u8c13\u8bcd\u51fd\u6570\u4f5c\u4e3a\u67e5\u627e\u89c4\u5219\n    vector<int>::iterator it = find_if(myvector.begin(), myvector.end(), mycomp2());\n    cout << \"*it = \" << *it;\n    return 0;\n}<\/code><\/pre>\n\n\n\n
    \u7a0b\u5e8f\u6267\u884c\u7ed3\u679c\u4e3a\uff1a<\/p>\n\n\n
    *it = 3<\/p>\n\n\n\n
    \u7ed3\u5408\u7a0b\u5e8f\u6267\u884c\u7ed3\u679c\u4e0d\u96be\u770b\u51fa\uff0c\u5bf9\u4e8e myvector \u5bb9\u5668\u4e2d\u7684\u5143\u7d20 4 \u548c 2 \u6765\u8bf4\uff0c\u5b83\u4eec\u90fd\u65e0\u6cd5\u4f7f (i%2)==1 \u8fd9\u4e2a\u8868\u8fbe\u5f0f\u6210\u7acb\uff0c\u56e0\u6b64 mycomp2() \u8fd4\u56de false\uff1b\u800c\u5bf9\u4e8e\u5143\u7d20 3 \u6765\u8bf4\uff0c\u5b83\u53ef\u4ee5\u4f7f mycomp2() \u51fd\u6570\u8fd4\u56de true\uff0c\u56e0\u6b64\uff0cfind_if() \u51fd\u6570\u627e\u5230\u7684\u7b2c\u4e00\u4e2a\u5143\u7d20\u5c31\u662f\u5143\u7d20 3\u3002<\/p>\n\n\n\n
    2.find_if_not<\/h3>\n\n\n\n
    find_if_not() \u51fd\u6570\u548c find_if() \u51fd\u6570\u7684\u529f\u80fd\u6070\u597d\u76f8\u53cd\uff0c\u901a\u8fc7\u4e0a\u9762\u7684\u5b66\u4e60\u6211\u4eec\u77e5\u9053\uff0cfind_if() \u51fd\u6570\u7528\u4e8e\u67e5\u627e\u7b26\u5408\u8c13\u8bcd\u51fd\u6570\u89c4\u5219\u7684\u7b2c\u4e00\u4e2a\u5143\u7d20\uff0c\u800c find_if_not() \u51fd\u6570\u5219\u7528\u4e8e\u67e5\u627e\u7b2c\u4e00\u4e2a\u4e0d\u7b26\u5408\u8c13\u8bcd\u51fd\u6570\u89c4\u5219\u7684\u5143\u7d20\u3002<\/p>\n\n\n\n
    find_if_not() \u51fd\u6570\u7684\u8bed\u6cd5\u89c4\u5219\u5982\u4e0b\u6240\u793a\uff1a<\/p>\n\n\n\n
    InputIterator find_if_not (InputIterator first, InputIterator last, UnaryPredicate pred);<\/p>\n\n\n\n
    \u5176\u4e2d\uff0cfirst \u548c last \u90fd\u4e3a\u8f93\u5165\u8fed\u4ee3\u5668\uff0c[first, last) \u7528\u4e8e\u6307\u5b9a\u67e5\u627e\u8303\u56f4\uff1bpred \u7528\u4e8e\u81ea\u5b9a\u4e49\u67e5\u627e\u89c4\u5219\u3002<\/p>\n\n\n\n
    \u548c find_if() \u51fd\u6570\u4e00\u6837\uff0cfind_if_not() \u51fd\u6570\u4e5f\u9002\u7528\u4e8e\u6240\u6709\u7684\u5bb9\u5668\uff0c\u5305\u62ec\u6240\u6709\u5e8f\u5217\u5f0f\u5bb9\u5668\u548c\u5173\u8054\u5f0f\u5bb9\u5668\u3002<\/p>\n\n\n\n
    \u540c\u6837\uff0c\u8be5\u51fd\u6570\u4e5f\u4f1a\u8fd4\u56de\u4e00\u4e2a\u8f93\u5165\u8fed\u4ee3\u5668\uff0c\u5f53 find_if_not() \u51fd\u6570\u67e5\u627e\u6210\u529f\u65f6\uff0c\u8be5\u8fed\u4ee3\u5668\u6307\u5411\u7684\u662f\u67e5\u627e\u5230\u7684\u90a3\u4e2a\u5143\u7d20\uff1b\u53cd\u4e4b\uff0c\u5982\u679c\u67e5\u627e\u5931\u8d25\uff0c\u8be5\u8fed\u4ee3\u5668\u7684\u6307\u5411\u548c last \u8fed\u4ee3\u5668\u76f8\u540c\u3002<\/p>\n\n\n\n
    \u5177\u4f53\u793a\u4f8b\u5982\u4e0b\uff1a<\/p>\n\n\n\n
    #include <iostream>     \/\/ std::cout\n#include <algorithm>    \/\/ std::find_if_not\n#include <vector>       \/\/ std::vector\nusing namespace std;\n\/\/\u81ea\u5b9a\u4e49\u4e00\u5143\u8c13\u8bcd\u51fd\u6570\nbool mycomp(int i) {\n    return ((i % 2) == 1);\n}\nint main() {\n    vector<int> myvector{4,2,3,1,5};\n    \/\/\u8c03\u7528 find_if() \u51fd\u6570\uff0c\u5e76\u4ee5 mycomp() \u4e00\u5143\u8c13\u8bcd\u51fd\u6570\u4f5c\u4e3a\u67e5\u627e\u89c4\u5219\n    vector<int>::iterator it = find_if_not(myvector.begin(), myvector.end(), mycomp);\n    cout << \"*it = \" << *it;\n    return 0;\n}<\/code><\/pre>\n\n\n\n
    \u7a0b\u5e8f\u6267\u884c\u7ed3\u679c\u4e3a\uff1a<\/p>\n\n\n
    *it = 4<\/p>\n\n\n\n
    \u53ef\u4ee5\u770b\u5230\uff0c\u7531\u4e8e\u7b2c\u4e00\u4e2a\u5143\u7d20 4 \u5c31\u4e0d\u7b26\u5408 (i%2)==1\uff0c\u56e0\u6b64 find_if_not() \u6210\u529f\u627e\u5230\u7b26\u5408\u6761\u4ef6\u7684\u5143\u7d20\uff0c\u5e76\u8fd4\u56de\u4e00\u4e2a\u6307\u5411\u8be5\u5143\u7d20\u7684\u8fed\u4ee3\u5668\u3002<\/p>\n\n\n\n
    \u4e09\u3001\u8fb9\u754c\u67e5\u627e<\/h2>\n\n\n\n
    1.adjacent_find<\/h3>\n\n\n\n
    \u201cadjacent\u201d\u7684\u610f\u601d\u662f\u201c\u76f8\u90bb\u7684\u201d\uff0cadjacent_find(beg , end)\u51fd\u6570\u7684\u529f\u80fd\u662f\uff1a\u7528\u4e8e\u5728\u5e8f\u5217[beg , end)\u4e2d\u67e5\u627e\u7b2c\u4e00\u5bf9\u76f8\u90bb\u5143\u7d20\uff0c\u8fd9\u4e24\u4e2a\u5143\u7d20\u6ee1\u8db3\u7279\u5b9a\u6761\u4ef6\uff08\u9ed8\u8ba4\u662f\u7edd\u5bf9\u76f8\u7b49\uff09\uff0c\u6709\u8fd4\u56de\u503c\uff0c\u5982\u679c\u627e\u5230\u7b2c\u4e00\u5bf9\u76f8\u90bb\u76f8\u7b49\u5143\u7d20\uff0c\u5219\u8fd4\u56de\u6307\u5411\u8be5\u5bf9\u5143\u7d20\u7684\u7b2c\u4e00\u4e2a\u5143\u7d20\u7684\u8fed\u4ee3\u5668\uff1b\u5426\u5219\u8fd4\u56de\u5bb9\u5668\u7684end()\u3002<\/p>\n\n\n\n
    \u5b83\u7684\u51fd\u6570\u6a21\u578b\u662f\uff1a<\/p>\n\n\n\n
    \/\/\u67e5\u627e 2 \u4e2a\u8fde\u7eed\u76f8\u7b49\u7684\u5143\u7d20\nForwardIterator adjacent_find (ForwardIterator first, ForwardIterator last);\n\/\/\u67e5\u627e 2 \u4e2a\u8fde\u7eed\u6ee1\u8db3 pred \u89c4\u5219\u7684\u5143\u7d20\nForwardIterator adjacent_find (ForwardIterator first, ForwardIterator last,\n BinaryPredicate pred);<\/code><\/pre>\n\n\n\n
    \u8be5\u51fd\u6570\u4f5c\u7528\u4e8e\u6b63\u5411\u8fed\u4ee3\u5668\uff0c\u4e5f\u5c31\u662f\u8bf4\u652f\u6301\u6240\u6709\u5e8f\u5217\u5f0f\u5bb9\u5668\uff0c\u4e5f\u652f\u6301\u5173\u8054\u5f0f\u5bb9\u5668\u4f46\u662f\u610f\u4e49\u4e0d\u5927\uff08\u4e3b\u8981\u662fequal_range()\u8868\u73b0\u66f4\u597d\uff09,\u4e0d\u652f\u6301\u5bb9\u5668\u9002\u914d\u5668\u5982stack\u5bb9\u5668\u7b49\uff08\u6ca1\u6709\u8fed\u4ee3\u5668\uff09\uff1b\u540c\u65f6\uff0c\u8be5\u51fd\u6570\u4e5f\u63a5\u53d7\u4e8c\u5143\u8c13\u8bcd\uff0c\u4f7f\u5f97\u6211\u4eec\u80fd\u591f\u4e0d\u62d8\u6ce5\u4e8e\u201c==\u201d\u7edd\u5bf9\u76f8\u7b49\u7684\u5173\u7cfb\uff0c\u8fd8\u53ef\u4ee5\u6709\u8bf8\u5982\u201c>=\u201d\u7b49\u81ea\u5b9a\u4e49\u5173\u7cfb\u3002<\/p>\n\n\n\n
    \u5177\u4f53\u793a\u4f8b\u5982\u4e0b\uff1a<\/p>\n\n\n\n
    #include<iostream>\n#include<vector>\n#include<map>\n#include<iterator> \/\/\u4f7f\u7528\u8fed\u4ee3\u5668\u51fd\u6570distance(beg,end) \u8ba1\u7b97\u4e0b\u6807\uff0c\u590d\u4e60\u524d\u9762\u77e5\u8bc6 \n#include<algorithm>\/\/\u5305\u542b\u7b97\u6cd5\u5934\u6587\u4ef6\uff01\nusing namespace std;\n\/*adjacent_find()*\/\n\/*\u7528\u4e8e\u5728\u5e8f\u5217[beg , end)\u4e2d\u67e5\u627e\u7b2c\u4e00\u5bf9\u76f8\u90bb\u5143\u7d20\uff0c\u8fd9\u4e24\u4e2a\u5143\u7d20\u6ee1\u8db3\u7279\u5b9a\u6761\u4ef6\uff08\u9ed8\u8ba4\u662f\u7edd\u5bf9\u76f8\u7b49\uff09*\/\nvoid test()\n{\nvector<int> v{1,2,3,3,4,5};\nauto pos = adjacent_find(v.begin(),v.end());\nif(pos!=v.end())\n{\ncout << \"\u5e8f\u5217{1,2,3,3,4,5}\u4e2d\u51fa\u73b0\u7b2c\u4e00\u5bf9\u76f8\u90bb\u76f8\u7b49\u5143\u7d20\u7684\u8d77\u59cb\u4e0b\u6807\u662f\uff1a\u3010\"<< distance(v.begin(),pos) << \"\u3011\\n\";\n}\n} \nint main(){\n    test();\n    return 0;\n}<\/code><\/pre>\n\n\n\n
    \u7a0b\u5e8f\u6267\u884c\u7ed3\u679c\u4e3a\uff1a<\/p>\n\n\n
    \u5e8f\u5217{1,2,3,3,4,5}\u4e2d\u51fa\u73b0\u7b2c\u4e00\u5bf9\u76f8\u90bb\u76f8\u7b49\u5143\u7d20\u7684\u8d77\u59cb\u4e0b\u6807\u662f\uff1a\u30102\u3011<\/p>\n\n\n\n
    \u5bf9\u4e8e\u5e8f\u5217{1,2,3,3,4,5}\uff0c\u6211\u4eec\u53ef\u4ee5\u770b\u5230\u7b2c\u4e00\u5bf9\u4e24\u4e2a\u76f8\u7b49\u76843\u4e14\u7b2c\u4e00\u4e2a3\u7684\u4e0b\u6807\u662f\u201c2\u201d\uff0c\u8f93\u51fa\u5b8c\u5168\u7b26\u5408\u6211\u4eec\u7684\u731c\u60f3\u3002\u518d\u6b21\u52a0\u6df1\u5370\u8c61\uff0cadjacent_find(beg , end)\u51fd\u6570\u7684\u529f\u80fd\u662f\uff1a\u5728\u5e8f\u5217[beg , end)\u4e2d\u67e5\u627e\u7b2c\u4e00\u5bf9\u76f8\u90bb\u5143\u7d20\uff0c\u4e3b\u8981\u5e94\u7528\u4e8e\u68c0\u67e5\u6570\u636e\u662f\u5426\u91cd\u590d\u3001\u5b57\u7b26\u4e32\u548c\u6587\u672c\u5904\u7406\u7b49\u573a\u666f\u3002<\/p>\n\n\n\n
    \u56db\u3001\u6a21\u5f0f\u67e5\u627e<\/strong><\/h2>\n\n\n\n
    1.find_end<\/h3>\n\n\n\n
    find_end\u7528\u4e8e\u67e5\u627e\u5bb9\u5668\u5185\u5b50\u5e8f\u5217\u7684\u6700\u540e\u4e00\u6b21\u51fa\u73b0\u3002\u5b83\u5728\u8303\u56f4[first1\uff0clast1)\u4e2d\u641c\u7d22\u7531[first2\uff0clast2)\u5b9a\u4e49\u7684\u5e8f\u5217\u7684\u6700\u540e\u4e00\u6b21\u51fa\u73b0\uff0c\u7136\u540e\u5c06\u8fed\u4ee3\u5668\u8fd4\u56de\u5230\u5176\u7b2c\u4e00\u4e2a\u5143\u7d20\uff0c\u5982\u679c\u6ca1\u6709\u53d1\u73b0\uff0c\u5219\u8fd4\u56delast1\u3002<\/p>\n\n\n\n
    \u6a21\u677f\u5982\u4e0b\uff1a<\/p>\n\n\n\n
    template <class ForwardIterator1, class ForwardIterator2>\nForwardIterator1 find_end(ForwardIterator1 first1, ForwardIterator1 last1,\n   ForwardIterator2 first2, ForwardIterator2 last2);<\/code><\/pre>\n\n\n\n
    \u53c2\u6570\u5217\u8868\u7684\u542b\u4e49\uff1a<\/p>\n\n\n\n
      \n
    • first1<\/strong> \u2212 \u5c06\u8fed\u4ee3\u5668\u8f6c\u53d1\u5230\u7b2c\u4e00\u4e2a\u5e8f\u5217\u7684\u521d\u59cb\u4f4d\u7f6e\u3002<\/li>\n\n\n\n
    • last1<\/strong> \u2212 \u5c06\u8fed\u4ee3\u5668\u8f6c\u53d1\u5230\u7b2c\u4e00\u4e2a\u5e8f\u5217\u7684\u6700\u7ec8\u4f4d\u7f6e\u3002<\/li>\n\n\n\n
    • first2<\/strong> \u2212 \u5c06\u8fed\u4ee3\u5668\u8f6c\u53d1\u5230\u7b2c\u4e8c\u4e2a\u5e8f\u5217\u7684\u521d\u59cb\u4f4d\u7f6e\u3002<\/li>\n\n\n\n
    • last2<\/strong> \u2212 \u5c06\u8fed\u4ee3\u5668\u8f6c\u53d1\u5230\u7b2c\u4e8c\u4e2a\u5e8f\u5217\u7684\u6700\u7ec8\u4f4d\u7f6e\u3002<\/li>\n<\/ul>\n\n\n\n
      \u8fd4\u56de\u4e00\u4e2a\u8fed\u4ee3\u5668\uff0c\u6307\u5411 first1\uff0clast1\u4e2d\u6700\u540e\u4e00\u6b21\u51fa\u73b0 (first2,last2)\u7684\u7b2c\u4e00\u4e2a\u5143\u7d20\u3002\u5982\u679c\u5143\u7d20\u6bd4\u8f83\u6216\u8fed\u4ee3\u5668\u4e0a\u7684\u64cd\u4f5c\u5f15\u53d1\u5f02\u5e38\uff0c\u5219\u5f15\u53d1\u5f02\u5e38\u3002\u8bf7\u6ce8\u610f\uff0c\u65e0\u6548\u53c2\u6570\u4f1a\u5bfc\u81f4\u672a\u5b9a\u4e49\u7684\u884c\u4e3a\u3002<\/p>\n\n\n\n
      \u5177\u4f53\u793a\u4f8b\u5982\u4e0b\uff1a<\/p>\n\n\n\n
      #include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nint main(void) {\n   vector<int> v1 = {1, 2, 1, 2, 1, 2};\n   vector<int> v2 = {1, 2};\n\n   auto result = find_end(v1.begin(), v1.end(), v2.begin(), v2.end());\n\n   if (result != v1.end())\n      cout << \"Last sequence found at location \"\n         << distance(v1.begin(), result) << endl;\n\n   v2 = {1, 3};\n\n   result = find_end(v1.begin(), v1.end(), v2.begin(), v2.end());\n\n   if (result == v1.end())\n      cout << \"Sequence doesn't present in vector.\" << endl;\n\n   return 0;\n}<\/code><\/pre>\n\n\n\n
      \u7a0b\u5e8f\u6267\u884c\u7ed3\u679c\u4e3a\uff1a<\/p>\n\n\n
      Last sequence found at location 4
      \nSequence doesn’t present in vector.<\/p>\n\n\n\n
      2.search<\/h3>\n\n\n\n
      find_end\u51fd\u6570\u7528\u4e8e\u5728\u5e8f\u5217 A \u4e2d\u67e5\u627e\u5e8f\u5217 B \u6700\u540e\u4e00\u6b21\u51fa\u73b0\u7684\u4f4d\u7f6e\u3002\u90a3\u4e48\uff0c\u5982\u679c\u60f3\u77e5\u9053\u5e8f\u5217 B \u5728\u5e8f\u5217 A \u4e2d\u7b2c\u4e00\u6b21\u51fa\u73b0\u7684\u4f4d\u7f6e\uff0c\u8be5\u5982\u4f55\u5b9e\u73b0\u5462\uff1f<\/p>\n\n\n\n
      search\u51fd\u80fd\u529f\u80fd\u6070\u597d\u548c find_end\u51fd\u6570\u76f8\u53cd\uff0c\u7528\u4e8e\u5728\u5e8f\u5217 A \u4e2d\u67e5\u627e\u5e8f\u5217 B \u7b2c\u4e00\u6b21\u51fa\u73b0\u7684\u4f4d\u7f6e\u3002<\/p>\n\n\n\n
      \u4f8b\u5982\uff0c\u4ee5\u5982\u4e0b\u4e24\u4e2a\u5e8f\u5217\u4e3a\u4f8b\uff1a<\/p>\n\n\n
      \u5e8f\u5217 A\uff1a1,2,3,4,5,1,2,3,4,5
      \n\u5e8f\u5217 B\uff1a1,2,3<\/p>\n\n\n\n
      \u53ef\u4ee5\u770b\u5230\uff0c\u5e8f\u5217 B \u5728\u5e8f\u5217 A \u4e2d\u51fa\u73b0\u4e86 2 \u6b21\u3002\u501f\u52a9 find_end() \u51fd\u6570\uff0c\u6211\u4eec\u53ef\u4ee5\u627e\u5230\u5e8f\u5217 A \u4e2d\u6700\u540e\u4e00\u4e2a\uff08\u4e5f\u5c31\u662f\u7b2c 2 \u4e2a\uff09{1,2,3}\uff1b\u800c\u501f\u52a9 search() \u51fd\u6570\uff0c\u6211\u4eec\u53ef\u4ee5\u627e\u5230\u5e8f\u5217 A \u4e2d\u7b2c 1 \u4e2a {1,2,3}\u3002<\/p>\n\n\n\n
      \u548c find_end\u76f8\u540c\uff0csearch\u51fd\u6570\u4e5f\u63d0\u4f9b\u6709\u4ee5\u4e0b 2 \u79cd\u8bed\u6cd5\u683c\u5f0f\uff1a<\/p>\n\n\n\n
      \/\/\u67e5\u627e [first1, last1) \u8303\u56f4\u5185\u7b2c\u4e00\u4e2a [first2, last2) \u5b50\u5e8f\u5217\nForwardIterator search (ForwardIterator first1, ForwardIterator last1,\n                        ForwardIterator first2, ForwardIterator last2);\n\/\/\u67e5\u627e [first1, last1) \u8303\u56f4\u5185\uff0c\u548c [first2, last2) \u5e8f\u5217\u6ee1\u8db3 pred \u89c4\u5219\u7684\u7b2c\u4e00\u4e2a\u5b50\u5e8f\u5217\nForwardIterator search (ForwardIterator first1, ForwardIterator last1,\n                        ForwardIterator first2, ForwardIterator last2,\n                        BinaryPredicate pred);<\/code><\/pre>\n\n\n\n
      \u5176\u4e2d\uff0c\u5404\u4e2a\u53c2\u6570\u7684\u542b\u4e49\u5206\u522b\u4e3a\uff1a<\/p>\n\n\n\n
        \n
      • first1\u3001last1\uff1a\u90fd\u4e3a\u6b63\u5411\u8fed\u4ee3\u5668\uff0c\u5176\u7ec4\u5408 [first1, last1) \u7528\u4e8e\u6307\u5b9a\u67e5\u627e\u8303\u56f4\uff08\u4e5f\u5c31\u662f\u4e0a\u9762\u4f8b\u5b50\u4e2d\u7684\u5e8f\u5217 A\uff09\uff1b<\/li>\n\n\n\n
      • first2\u3001last2\uff1a\u90fd\u4e3a\u6b63\u5411\u8fed\u4ee3\u5668\uff0c\u5176\u7ec4\u5408 [first2, last2) \u7528\u4e8e\u6307\u5b9a\u8981\u67e5\u627e\u7684\u5e8f\u5217\uff08\u4e5f\u5c31\u662f\u4e0a\u9762\u4f8b\u5b50\u4e2d\u7684\u5e8f\u5217 B\uff09\uff1b<\/li>\n\n\n\n
      • pred\uff1a\u7528\u4e8e\u81ea\u5b9a\u4e49\u67e5\u627e\u89c4\u5219\u3002\u8be5\u89c4\u5219\u5b9e\u9645\u4e0a\u662f\u4e00\u4e2a\u5305\u542b 2 \u4e2a\u53c2\u6570\u4e14\u8fd4\u56de\u503c\u7c7b\u578b\u4e3a bool \u7684\u51fd\u6570\uff08\u7b2c\u4e00\u4e2a\u53c2\u6570\u63a5\u6536 [first1, last1) \u8303\u56f4\u5185\u7684\u5143\u7d20\uff0c\u7b2c\u4e8c\u4e2a\u53c2\u6570\u63a5\u6536 [first2, last2) \u8303\u56f4\u5185\u7684\u5143\u7d20\uff09\u3002\u51fd\u6570\u5b9a\u4e49\u7684\u5f62\u5f0f\u53ef\u4ee5\u662f\u666e\u901a\u51fd\u6570\uff0c\u4e5f\u53ef\u4ee5\u662f\u51fd\u6570\u5bf9\u8c61\u3002<\/li>\n<\/ul>\n\n\n\n
        \u5b9e\u9645\u4e0a\uff0c\u7b2c\u4e00\u79cd\u8bed\u6cd5\u683c\u5f0f\u4e5f\u53ef\u4ee5\u770b\u505a\u662f\u5305\u542b\u4e00\u4e2a\u9ed8\u8ba4\u7684 pred \u53c2\u6570\uff0c\u8be5\u53c2\u6570\u6307\u5b9a\u7684\u662f\u4e00\u79cd\u76f8\u7b49\u89c4\u5219\uff0c\u5373\u5728 [first1, last1) \u8303\u56f4\u5185\u67e5\u627e\u548c [first2, last2) \u4e2d\u5404\u4e2a\u5143\u7d20\u5bf9\u5e94\u76f8\u7b49\u7684\u5b50\u5e8f\u5217\uff1b\u800c\u501f\u52a9\u7b2c\u4e8c\u79cd\u8bed\u6cd5\u683c\u5f0f\uff0c\u6211\u4eec\u53ef\u4ee5\u81ea\u5b9a\u4e49\u4e00\u4e2a\u5f53\u524d\u573a\u666f\u9700\u8981\u7684\u5339\u914d\u89c4\u5219\u3002<\/p>\n\n\n\n
        \u540c\u65f6\uff0csearch\u51fd\u6570\u4f1a\u8fd4\u56de\u4e00\u4e2a\u6b63\u5411\u8fed\u4ee3\u5668\uff0c\u5f53\u51fd\u6570\u67e5\u627e\u6210\u529f\u65f6\uff0c\u8be5\u8fed\u4ee3\u5668\u6307\u5411\u67e5\u627e\u5230\u7684\u5b50\u5e8f\u5217\u4e2d\u7684\u7b2c\u4e00\u4e2a\u5143\u7d20\uff1b\u53cd\u4e4b\uff0c\u5982\u679c\u67e5\u627e\u5931\u8d25\uff0c\u5219\u8be5\u8fed\u4ee3\u5668\u7684\u6307\u5411\u548c last1 \u8fed\u4ee3\u5668\u76f8\u540c\u3002<\/p>\n\n\n\n
        \u5177\u4f53\u793a\u4f8b\u5982\u4e0b\uff1a<\/p>\n\n\n\n
        #include <iostream>     \/\/ std::cout\n#include <algorithm>    \/\/ std::search\n#include <vector>       \/\/ std::vector\nusing namespace std;\n\/\/\u4ee5\u666e\u901a\u51fd\u6570\u7684\u5f62\u5f0f\u5b9a\u4e49\u4e00\u4e2a\u5339\u914d\u89c4\u5219\nbool mycomp1(int i, int j) {\n    return (i%j == 0);\n}\n\/\/\u4ee5\u51fd\u6570\u5bf9\u8c61\u7684\u5f62\u5f0f\u5b9a\u4e49\u4e00\u4e2a\u5339\u914d\u89c4\u5219\nclass mycomp2 {\npublic:\n    bool operator()(const int& i, const int& j) {\n        return (i%j == 0);\n    }\n};\nint main() {\n    vector<int> myvector{ 1,2,3,4,8,12,18,1,2,3 };\n    int myarr[] = { 1,2,3 };\n    \/\/\u8c03\u7528\u7b2c\u4e00\u79cd\u8bed\u6cd5\u683c\u5f0f\n    vector<int>::iterator it = search(myvector.begin(), myvector.end(), myarr, myarr + 3);\n    if (it != myvector.end()) {\n        cout << \"\u7b2c\u4e00\u4e2a{1,2,3}\u7684\u8d77\u59cb\u4f4d\u7f6e\u4e3a\uff1a\" << it - myvector.begin() << \",*it = \" << *it << endl;\n    }\n    int myarr2[] = { 2,4,6 };\n    \/\/\u8c03\u7528\u7b2c\u4e8c\u79cd\u8bed\u6cd5\u683c\u5f0f\n    it = search(myvector.begin(), myvector.end(), myarr2, myarr2 + 3, mycomp2());\n    if (it != myvector.end()) {\n        cout << \"\u7b2c\u4e00\u4e2a{2,3,4}\u7684\u8d77\u59cb\u4f4d\u7f6e\u4e3a\uff1a\" << it - myvector.begin() << \",*it = \" << *it;\n    }\n    return 0;\n}<\/code><\/pre>\n\n\n\n
        \u7a0b\u5e8f\u6267\u884c\u7ed3\u679c\u4e3a\uff1a<\/p>\n\n\n
        \u7b2c\u4e00\u4e2a{1,2,3}\u7684\u8d77\u59cb\u4f4d\u7f6e\u4e3a\uff1a0,*it = 1
        \n\u7b2c\u4e00\u4e2a{2,3,4}\u7684\u8d77\u59cb\u4f4d\u7f6e\u4e3a\uff1a3,*it = 4<\/p>\n\n\n\n
        \u901a\u8fc7\u7a0b\u5e8f\u7684\u6267\u884c\u7ed3\u679c\u53ef\u4ee5\u770b\u5230\uff0c\u7b2c 22 \u884c\u4ee3\u7801\u501f\u52a9 search\u51fd\u6570\u627e\u5230\u4e86 myvector \u5bb9\u5668\u4e2d\u7b2c\u4e00\u4e2a {1,2,3}\uff0c\u5e76\u8fd4\u56de\u4e86\u4e00\u4e2a\u6307\u5411\u5143\u7d20 1 \u7684\u8fed\u4ee3\u5668\uff08\u5176\u4e0b\u6807\u4f4d\u7f6e\u4e3a 0\uff09\u3002<\/p>\n\n\n\n
        \u800c\u5728\u7b2c 29 \u884c\u4e2d\uff0csearch\u51fd\u6570\u4f7f\u7528\u7684\u662f\u7b2c 2 \u79cd\u683c\u5f0f\uff0c\u5176\u81ea\u5b9a\u4e49\u4e86 mycomp2 \u5339\u914d\u89c4\u5219\uff0c\u5373\u5728 myvector \u5bb9\u5668\u4e2d\u627e\u5230\u7b2c\u4e00\u4e2a\u8fde\u7eed\u7684 3 \u4e2a\u5143\u7d20\uff0c\u5b83\u4eec\u80fd\u5206\u522b\u88ab 2\u30014\u30016 \u6574\u9664\u3002\u663e\u7136\uff0cmyvector \u5bb9\u5668\u4e2d\u7b26\u5408\u8981\u6c42\u7684\u5b50\u5e8f\u5217\u6709 2 \u4e2a\uff0c\u5206\u522b\u4e3a {4,8,12} \u548c {8,12,18}\uff0c\u4f46 search() \u51fd\u6570\u53ea\u4f1a\u67e5\u627e\u5230\u7b2c\u4e00\u4e2a\uff0c\u5e76\u8fd4\u56de\u6307\u5411\u5143\u7d20 4 \u7684\u8fed\u4ee3\u5668\uff08\u5176\u4e0b\u6807\u4e3a 3\uff09\u3002<\/p>\n\n\n\n
        \u6ce8\u610f\uff0csearch\u51fd\u6570\u7684\u7b2c\u4e00\u79cd\u8bed\u6cd5\u683c\u5f0f\uff0c\u5176\u5e95\u5c42\u662f\u501f\u52a9 == \u8fd0\u7b97\u7b26\u5b9e\u73b0\u7684\u3002\u8fd9\u610f\u5473\u7740\uff0c\u5982\u679c [first1, last1] \u548c [first2, last2] \u533a\u57df\u5185\u7684\u5143\u7d20\u4e3a\u81ea\u5b9a\u4e49\u7684\u7c7b\u5bf9\u8c61\u6216\u7ed3\u6784\u4f53\u53d8\u91cf\u65f6\uff0c\u4f7f\u7528\u8be5\u51fd\u6570\u4e4b\u524d\u9700\u8981\u5bf9 == \u8fd0\u7b97\u7b26\u8fdb\u884c\u91cd\u8f7d\u3002<\/p>\n\n\n\n
        3.search_n<\/h3>\n\n\n\n
        search_n\u51fd\u6570\u548csearch\u51fd\u6570\u5f88\u50cf\uff0c\u4e0d\u540c\u4e4b\u5904\u5728\u4e8e\uff0c\u524d\u8005\u67e5\u627e\u7684\u5b50\u5e8f\u5217\u4e2d\u53ef\u5305\u542b\u591a\u4e2a\u4e0d\u540c\u7684\u5143\u7d20\uff0c\u800c\u540e\u8005\u67e5\u627e\u7684\u53ea\u80fd\u662f\u5305\u542b\u591a\u4e2a\u76f8\u540c\u5143\u7d20\u7684\u5b50\u5e8f\u5217\u3002<\/p>\n\n\n\n
        \u4e0b\u9762\u6709\u4e09\u4e2a\u5b9e\u4f8b\uff1a<\/p>\n\n\n
        \u5e8f\u5217 A\uff1a1,2,3,4,4,4,1,2,3,4,4,4
        \n\u5e8f\u5217 B\uff1a1,2,3
        \n\u5e8f\u5217 C\uff1a4,4,4<\/p>\n\n\n\n
        \u5982\u679c\u60f3\u67e5\u627e\u5e8f\u5217 B \u5728\u5e8f\u5217 A \u4e2d\u7b2c\u4e00\u6b21\u51fa\u73b0\u7684\u4f4d\u7f6e\uff0c\u5c31\u53ea\u80fd\u4f7f\u7528 search\u51fd\u6570\uff1b\u800c\u5982\u679c\u60f3\u67e5\u627e\u5e8f\u5217 C \u5728\u5e8f\u5217 A \u4e2d\u7b2c\u4e00\u6b21\u51fa\u73b0\u7684\u4f4d\u7f6e\uff0c\u65e2\u53ef\u4ee5\u4f7f\u7528 search\u51fd\u6570\uff0c\u4e5f\u53ef\u4ee5\u4f7f\u7528 search_n\u51fd\u6570\u3002<\/p>\n\n\n\n
        search_n\u51fd\u6570\u7684\u8bed\u6cd5\u683c\u5f0f\u5982\u4e0b\uff1a<\/p>\n\n\n\n
        \/\/\u5728 [first, last] \u4e2d\u67e5\u627e count \u4e2a val \u7b2c\u4e00\u6b21\u8fde\u7eed\u51fa\u73b0\u7684\u4f4d\u7f6e\nForwardIterator search_n (ForwardIterator first, ForwardIterator last,\n                          Size count, const T& val);\n\/\/\u5728 [first, last] \u4e2d\u67e5\u627e\u7b2c\u4e00\u4e2a\u5e8f\u5217\uff0c\u8be5\u5e8f\u5217\u548c count \u4e2a val \u6ee1\u8db3 pred \u5339\u914d\u89c4\u5219\nForwardIterator search_n ( ForwardIterator first, ForwardIterator last,\n                           Size count, const T& val, BinaryPredicate pred );<\/code><\/pre>\n\n\n\n
        \u5176\u4e2d\uff0c\u5404\u4e2a\u53c2\u6570\u7684\u542b\u4e49\u5206\u522b\u4e3a\uff1a<\/p>\n\n\n\n
          \n
        • first\u3001last\uff1a\u90fd\u4e3a\u6b63\u5411\u8fed\u4ee3\u5668\uff0c\u5176\u7ec4\u5408 [first, last) \u7528\u4e8e\u6307\u5b9a\u67e5\u627e\u8303\u56f4\uff08\u4e5f\u5c31\u662f\u4e0a\u9762\u4f8b\u5b50\u4e2d\u7684\u5e8f\u5217 A\uff09\uff1b<\/li>\n\n\n\n
        • count\u3001val\uff1a\u6307\u5b9a\u8981\u67e5\u627e\u7684\u5143\u7d20\u4e2a\u6570\u548c\u5143\u7d20\u503c\uff0c\u4ee5\u4e0a\u9762\u7684\u5e8f\u5217 B \u4e3a\u4f8b\uff0c\u8be5\u5e8f\u5217\u5b9e\u9645\u4e0a\u5c31\u662f 3 \u4e2a\u5143\u7d20 4\uff0c\u5176\u4e2d count \u4e3a 3\uff0cval \u4e3a 4\uff1b<\/li>\n\n\n\n
        • pred\uff1a\u7528\u4e8e\u81ea\u5b9a\u4e49\u67e5\u627e\u89c4\u5219\u3002\u8be5\u89c4\u5219\u5b9e\u9645\u4e0a\u662f\u4e00\u4e2a\u5305\u542b 2 \u4e2a\u53c2\u6570\u4e14\u8fd4\u56de\u503c\u7c7b\u578b\u4e3a bool \u7684\u51fd\u6570\uff08\u7b2c\u4e00\u4e2a\u53c2\u6570\u63a5\u6536[first, last) \u8303\u56f4\u5185\u7684\u5143\u7d20\uff0c\u7b2c\u4e8c\u4e2a\u53c2\u6570\u63a5\u6536 val\uff09\u3002\u51fd\u6570\u5b9a\u4e49\u7684\u5f62\u5f0f\u53ef\u4ee5\u662f\u666e\u901a\u51fd\u6570\uff0c\u4e5f\u53ef\u4ee5\u662f\u51fd\u6570\u5bf9\u8c61\u3002<\/li>\n<\/ul>\n\n\n\n
          \u5b9e\u9645\u4e0a\uff0c\u7b2c\u4e00\u79cd\u8bed\u6cd5\u683c\u5f0f\u4e5f\u53ef\u4ee5\u770b\u505a\u662f\u5305\u542b\u4e00\u4e2a\u9ed8\u8ba4\u7684 pred \u53c2\u6570\uff0c\u8be5\u53c2\u6570\u6307\u5b9a\u7684\u662f\u4e00\u79cd\u76f8\u7b49\u89c4\u5219\uff0c\u5373\u5728 [first, last) \u8303\u56f4\u5185\u67e5\u627e\u548c count \u4e2a val \u76f8\u7b49\u7684\u5b50\u5e8f\u5217\uff1b\u800c\u501f\u52a9\u7b2c\u4e8c\u79cd\u8bed\u6cd5\u683c\u5f0f\uff0c\u6211\u4eec\u53ef\u4ee5\u81ea\u5b9a\u4e49\u4e00\u4e2a\u5f53\u524d\u573a\u666f\u9700\u8981\u7684\u5339\u914d\u89c4\u5219\u3002\u540c\u65f6\uff0csearch_n\u51fd\u6570\u4f1a\u8fd4\u56de\u4e00\u4e2a\u6b63\u5411\u8fed\u4ee3\u5668\uff0c\u5f53\u51fd\u6570\u67e5\u627e\u6210\u529f\u65f6\uff0c\u8be5\u8fed\u4ee3\u5668\u6307\u5411\u67e5\u627e\u5230\u7684\u5b50\u5e8f\u5217\u4e2d\u7684\u7b2c\u4e00\u4e2a\u5143\u7d20\uff1b\u53cd\u4e4b\uff0c\u5982\u679c\u67e5\u627e\u5931\u8d25\uff0c\u5219\u8be5\u8fed\u4ee3\u5668\u7684\u6307\u5411\u548c last \u8fed\u4ee3\u5668\u76f8\u540c\u3002<\/p>\n\n\n\n
          \u5177\u4f53\u793a\u4f8b\u5982\u4e0b\uff1a<\/p>\n\n\n\n
          #include <iostream>     \/\/ std::cout\n#include <algorithm>    \/\/ std::search_n\n#include <vector>       \/\/ std::vector\nusing namespace std;\n\/\/\u4ee5\u666e\u901a\u51fd\u6570\u7684\u5f62\u5f0f\u5b9a\u4e49\u4e00\u4e2a\u5339\u914d\u89c4\u5219\nbool mycomp1(int i, int j) {\n    return (i%j == 0);\n}\n\/\/\u4ee5\u51fd\u6570\u5bf9\u8c61\u7684\u5f62\u5f0f\u5b9a\u4e49\u4e00\u4e2a\u5339\u914d\u89c4\u5219\nclass mycomp2 {\npublic:\n    bool operator()(const int& i, const int& j) {\n        return (i%j == 0);\n    }\n};\nint main() {\n    int a[] = { 1,2,3,4,4,4,1,2,3,4,4,4 };\n    \/\/\u8c03\u7528\u7b2c\u4e00\u79cd\u8bed\u6cd5\u683c\u5f0f,\u67e5\u627e myvector \u5bb9\u5668\u4e2d\u7b2c\u4e00\u4e2a {4,4,4}\n    int * it = search_n(a, a+12, 3, 4);\n    if (it != a+12) {\n        cout << \"one\uff1a\" << it - a << \",*it = \" << *it << endl;\n    }\n    vector<int> myvector{1,2,4,8,3,4,6,8};\n    \/\/\u8c03\u7528\u7b2c\u4e8c\u79cd\u8bed\u6cd5\u683c\u5f0f\uff0c\u4ee5\u81ea\u5b9a\u4e49\u7684 mycomp2 \u4f5c\u4e3a\u5339\u914d\u89c4\u5219\uff0c\u67e5\u627e myvector \u5bb9\u5668\u4e2d\u548c {16,16,16} \u6ee1\u8db3 mycomp2 \u89c4\u5219\u7684\u5e8f\u5217\n    vector<int>::iterator iter = search_n(myvector.begin(), myvector.end(), 3, 2, mycomp2());\n    if (iter != myvector.end()) {\n        cout << \"two\uff1a\" << iter - myvector.begin() << \",*iter = \" << *iter;\n    }\n    return 0;\n}<\/code><\/pre>\n\n\n\n
          \u7a0b\u5e8f\u6267\u884c\u7ed3\u679c\u4e3a\uff1a<\/p>\n\n\n
          one\uff1a3,*it = 4
          \ntwo\uff1a1,*iter = 2<\/p>\n\n\n\n
          \u7a0b\u5e8f\u4e2d\u5148\u540e\u8c03\u7528\u4e86 2 \u79cd\u8bed\u6cd5\u683c\u5f0f\u7684 search_n\u51fd\u6570\uff0c\u5176\u4e2d\u7b2c 28 \u884c\u4ee3\u7801\u4e2d\uff0csearch_n\u51fd\u6570\u4e0d\u518d\u91c7\u7528\u9ed8\u8ba4\u7684\u76f8\u7b49\u5339\u914d\u89c4\u5219\uff0c\u800c\u662f\u91c7\u7528\u4e86\u81ea\u5b9a\u4e49\u4e86 mycomp2 \u5339\u914d\u89c4\u5219\u3002\u8fd9\u610f\u5473\u7740\uff0c\u8be5\u51fd\u6570\u4f1a\u53bb myvector \u5bb9\u5668\u4e2d\u67e5\u627e\u4e00\u4e2a\u5b50\u5e8f\u5217\uff0c\u8be5\u5e8f\u5217\u4e2d\u7684 3 \u4e2a\u5143\u7d20\u90fd\u6ee1\u8db3\u548c 2 \u6709 (i%j == 0) \u7684\u5173\u7cfb\u3002\u663e\u7136\uff0cmyvector \u5bb9\u5668\u4e2d\u7b26\u5408\u6761\u4ef6\u7684\u5b50\u5e8f\u5217\u6709 2 \u4e2a\uff0c\u5206\u522b\u4e3a {2,4,8} \u548c {4,6,8}\uff0c\u4f46 search_n\u51fd\u6570\u53ea\u4f1a\u67e5\u627e\u5230 {2,4,8}\u3002<\/p>\n\n\n\n
          \u6ce8\u610f\uff0csearch_n\u51fd\u6570\u7684\u7b2c\u4e00\u79cd\u8bed\u6cd5\u683c\u5f0f\uff0c\u5176\u5e95\u5c42\u662f\u501f\u52a9 == \u8fd0\u7b97\u7b26\u5b9e\u73b0\u7684\u3002\u8fd9\u610f\u5473\u7740\uff0c\u5982\u679c [first, last] \u533a\u57df\u5185\u7684\u5143\u7d20\u4e3a\u81ea\u5b9a\u4e49\u7684\u7c7b\u5bf9\u8c61\u6216\u7ed3\u6784\u4f53\u53d8\u91cf\u65f6\uff0c\u4f7f\u7528\u6b64\u683c\u5f0f\u7684 search_n\u51fd\u6570\u4e4b\u524d\uff0c\u9700\u8981\u5bf9 == \u8fd0\u7b97\u7b26\u8fdb\u884c\u91cd\u8f7d\u3002<\/p>\n\n\n\n
          \u4e94\u3001 \u6709\u5e8f\u67e5\u627e<\/strong><\/h2>\n\n\n\n
          \u8fd9\u4e00\u90e8\u5206\u662f\u7b97\u6cd5\u7ade\u8d5b\u4e2d\u67e5\u627e\u6700\u5e38\u7528\u7684\u51fd\u6570\uff0c\u975e\u5e38\u91cd\u8981\u3002<\/p>\n\n\n\n
          1.binary_search<\/h3>\n\n\n\n
          binary_search()\u51fd\u6570\u7528\u4e8e\u67e5\u627e\u6307\u5b9a\u533a\u57df\u5185\u662f\u5426\u5305\u542b\u67d0\u4e2a\u76ee\u6807\u5143\u7d20\u3002<\/p>\n\n\n\n
          \u8be5\u51fd\u6570\u6709 2 \u79cd\u8bed\u6cd5\u683c\u5f0f\uff0c\u5206\u522b\u4e3a\uff1a<\/p>\n\n\n\n
          \/\/\u67e5\u627e [first, last) \u533a\u57df\u5185\u662f\u5426\u5305\u542b val\nbool binary_search (ForwardIterator first, ForwardIterator last,\n                      const T& val);\n\/\/\u6839\u636e comp \u6307\u5b9a\u7684\u89c4\u5219\uff0c\u67e5\u627e [first, last) \u533a\u57df\u5185\u662f\u5426\u5305\u542b val\nbool binary_search (ForwardIterator first, ForwardIterator last,\n                      const T& val, Compare comp);<\/code><\/pre>\n\n\n\n
          \u5176\u4e2d\uff0cfirst \u548c last \u90fd\u4e3a\u6b63\u5411\u8fed\u4ee3\u5668\uff0c[first, last) \u7528\u4e8e\u6307\u5b9a\u8be5\u51fd\u6570\u7684\u4f5c\u7528\u8303\u56f4\uff1bval \u7528\u4e8e\u6307\u5b9a\u8981\u67e5\u627e\u7684\u76ee\u6807\u503c\uff1bcomp \u7528\u4e8e\u81ea\u5b9a\u4e49\u67e5\u627e\u89c4\u5219\uff0c\u6b64\u53c2\u6570\u53ef\u63a5\u6536\u4e00\u4e2a\u5305\u542b 2 \u4e2a\u5f62\u53c2\uff08\u7b2c\u4e00\u4e2a\u5f62\u53c2\u503c\u4e3a val\uff09\u4e14\u8fd4\u56de\u503c\u4e3a bool \u7c7b\u578b\u7684\u51fd\u6570\uff0c\u53ef\u4ee5\u662f\u666e\u901a\u51fd\u6570\uff0c\u4e5f\u53ef\u4ee5\u662f\u51fd\u6570\u5bf9\u8c61\u3002<\/p>\n\n\n\n
          \u540c\u65f6\uff0c\u8be5\u51fd\u6570\u4f1a\u8fd4\u56de\u4e00\u4e2a bool \u7c7b\u578b\u503c\uff0c\u5982\u679c binary_search() \u51fd\u6570\u5728 [first, last) \u533a\u57df\u5185\u6210\u529f\u627e\u5230\u548c val \u76f8\u7b49\u7684\u5143\u7d20\uff0c\u5219\u8fd4\u56de true\uff1b\u53cd\u4e4b\u5219\u8fd4\u56de false\u3002<\/p>\n\n\n\n
          \u9700\u8981\u6ce8\u610f\u7684\u662f\uff0c\u7531\u4e8e binary_search() \u5e95\u5c42\u5b9e\u73b0\u91c7\u7528\u7684\u662f\u4e8c\u5206\u67e5\u627e\u7684\u65b9\u5f0f\uff0c\u56e0\u6b64\u8be5\u51fd\u6570\u4ec5\u9002\u7528\u4e8e\u201c\u5df2\u6392\u597d\u5e8f\u201d\u7684\u5e8f\u5217\u3002\u6240\u8c13\u201c\u5df2\u6392\u597d\u5e8f\u201d\uff0c\u5e76\u4e0d\u662f\u8981\u6c42 [first, last) \u533a\u57df\u5185\u7684\u6570\u636e\u4e25\u683c\u6309\u7167\u67d0\u4e2a\u6392\u5e8f\u89c4\u5219\u8fdb\u884c\u5347\u5e8f\u6216\u964d\u5e8f\u6392\u5e8f\uff0c\u53ea\u8981\u6ee1\u8db3\u201c\u6240\u6709\u4ee4 element<val\uff08\u6216\u8005 comp(val, element\uff09\u6210\u7acb\u7684\u5143\u7d20\u90fd\u4f4d\u4e8e\u4e0d\u6210\u7acb\u5143\u7d20\u7684\u524d\u9762\uff08\u5176\u4e2d element \u4e3a\u6307\u5b9a\u8303\u56f4\u5185\u7684\u5143\u7d20\uff09\u201d\u5373\u53ef\u3002<\/p>\n\n\n\n
          \u5177\u4f53\u793a\u4f8b\u5982\u4e0b\uff1a<\/p>\n\n\n\n
          #include <iostream>     \/\/ std::cout\n#include <algorithm>    \/\/ std::binary_search\n#include <vector>       \/\/ std::vector\nusing namespace std;\n\/\/\u4ee5\u666e\u901a\u51fd\u6570\u7684\u65b9\u5f0f\u5b9a\u4e49\u67e5\u627e\u89c4\u5219\nbool mycomp(int i, int j) { return i > j; }\n\/\/\u4ee5\u51fd\u6570\u5bf9\u8c61\u7684\u5f62\u5f0f\u5b9a\u4e49\u67e5\u627e\u89c4\u5219\nclass mycomp2 {\npublic:\n    bool operator()(const int& i, const int& j) {\n        return i > j;\n    }\n};\nint main() {\n    int a[7] = { 1,2,3,4,5,6,7 };\n    \/\/\u4ece a \u6570\u7ec4\u4e2d\u67e5\u627e\u5143\u7d20 4\n    bool haselem = binary_search(a, a + 9, 4);\n    cout << \"haselem\uff1a\" << haselem << endl;\n    vector<int>myvector{ 4,5,3,1,2 };\n    \/\/\u4ece myvector \u5bb9\u5668\u67e5\u627e\u5143\u7d20 3\n    bool haselem2 = binary_search(myvector.begin(), myvector.end(), 3, mycomp2());\n    cout << \"haselem2\uff1a\" << haselem2;\n    return 0;\n}<\/code><\/pre>\n\n\n\n
          \u7a0b\u5e8f\u6267\u884c\u7ed3\u679c\u4e3a\uff1a<\/p>\n\n\n
          haselem\uff1a1
          \nhaselem2\uff1a1<\/p>\n\n\n\n
          \u6b64\u7a0b\u5e8f\u4e2d\u6f14\u793a\u4e86 binary_search() \u51fd\u6570\u7684 2 \u79cd\u9002\u7528\u573a\u666f\uff0c\u5176\u4e2d a[7] \u6570\u7ec4\u4e2d\u5b58\u50a8\u7684\u4e3a\u5347\u5e8f\u5e8f\u5217\uff1b\u800c myvector \u5bb9\u5668\u4e2d\u5b58\u50a8\u7684\u5e8f\u5217\u867d\u7136\u6574\u4f53\u662f\u4e71\u5e8f\u7684\uff0c\u4f46\u5bf9\u4e8e\u76ee\u6807\u5143\u7d20 3 \u6765\u8bf4\uff0c\u6240\u6709\u7b26\u5408 mycomp2(element, 3) \u89c4\u5219\u7684\u5143\u7d20\u90fd\u4f4d\u4e8e\u5176\u5de6\u4fa7\uff0c\u4e0d\u7b26\u5408\u7684\u5143\u7d20\u90fd\u4f4d\u4e8e\u5176\u53f3\u4fa7\uff0c\u56e0\u6b64 binary_search() \u51fd\u6570\u4ecd\u53ef\u6b63\u5e38\u6267\u884c\u3002<\/p>\n\n\n\n
          2.lower_bound\u3001upper_bound<\/h3>\n\n\n\n
           lower_bound() \u548c upper_bound() \u662f\u4e24\u4e2a\u7528\u4e8e\u5728\u6709\u5e8f\u96c6\u5408\u4e2d\u8fdb\u884c\u4e8c\u5206\u67e5\u627e\u7684\u9ad8\u6548\u51fd\u6570\u3002\u5b83\u4eec\u7684\u65f6\u95f4\u590d\u6742\u5ea6\u4e3a O(log n)\uff0c\u9002\u7528\u4e8e\u5feb\u901f\u67e5\u627e\u7279\u5b9a\u503c\u7684\u4f4d\u7f6e\u6216\u8303\u56f4\u3002<\/p>\n\n\n\n
          lower_bound() \u51fd\u6570\u8fd4\u56de\u6307\u5411\u7b2c\u4e00\u4e2a\u4e0d\u5c0f\u4e8e\u7ed9\u5b9a\u503c\u7684\u5143\u7d20\u7684\u8fed\u4ee3\u5668\u3002\u5982\u679c\u6240\u6709\u5143\u7d20\u90fd\u5c0f\u4e8e\u8be5\u503c\uff0c\u5219\u8fd4\u56de\u6307\u5411\u5e8f\u5217\u5c3e\u90e8\u7684\u8fed\u4ee3\u5668\u3002\u5982\u679c\u5b58\u5728\u591a\u4e2a\u76f8\u7b49\u7684\u5143\u7d20\uff0c\u5219\u8fd4\u56de\u6307\u5411\u7b2c\u4e00\u4e2a\u5143\u7d20\u7684\u8fed\u4ee3\u5668\u3002<\/p>\n\n\n\n
          \u4e0b\u9762\u662f\u4f7f\u7528 lower_bound() \u51fd\u6570\u7684\u793a\u4f8b\u4ee3\u7801\uff1a<\/p>\n\n\n\n
          #include <bits\/stdc++.h>\nusing namespace std;\nint main() {\n    vector<int> v = {1, 3, 5, 7, 9};      \/\/ \u5b9a\u4e49\u4e00\u4e2a\u6574\u6570\u7c7b\u578b\u7684\u5411\u91cf v\uff0c\u5e76\u521d\u59cb\u5316\u4e3a {1, 3, 5, 7, 9}\n    int val = 5;                          \/\/ \u5b9a\u4e49\u4e00\u4e2a\u6574\u6570\u53d8\u91cf val\uff0c\u5e76\u8d4b\u503c\u4e3a 5\n    auto it = lower_bound(v.begin(), v.end(), val);  \/\/ \u4f7f\u7528 lower_bound() \u51fd\u6570\u67e5\u627e\u5728\u6709\u5e8f\u5bb9\u5668 v \u4e2d\u7b2c\u4e00\u4e2a\u5927\u4e8e\u6216\u7b49\u4e8e val \u7684\u5143\u7d20\u7684\u8fed\u4ee3\u5668\n    if (it != v.end())                    \/\/ \u5982\u679c\u627e\u5230\u4e86\u7b26\u5408\u6761\u4ef6\u7684\u5143\u7d20\n        cout << \"Found at index: \" << it - v.begin();  \/\/ \u5219\u8f93\u51fa\u8be5\u5143\u7d20\u7684\u7d22\u5f15\uff08\u901a\u8fc7\u8ba1\u7b97\u8fed\u4ee3\u5668\u4e0e\u8d77\u59cb\u8fed\u4ee3\u5668\u7684\u5dee\u503c\uff09\n    else                                  \/\/ \u5982\u679c\u6ca1\u6709\u627e\u5230\u7b26\u5408\u6761\u4ef6\u7684\u5143\u7d20\n        cout << \"Not found\";              \/\/ \u5219\u8f93\u51fa \"Not found\"\n    return 0;\n}<\/code><\/pre>\n\n\n\n
          \u7a0b\u5e8f\u4e2d\uff0cauto it \u662f\u4e00\u4e2a\u53d8\u91cf\u58f0\u660e\u8bed\u53e5\uff0c\u4f7f\u7528 auto \u5173\u952e\u5b57\u8fdb\u884c\u81ea\u52a8\u7c7b\u578b\u63a8\u5bfc\uff0c\u5b83\u5c06\u6839\u636e\u53f3\u4fa7\u7684\u521d\u59cb\u5316\u8868\u8fbe\u5f0f\u7684\u503c\u6765\u63a8\u65ad\u53d8\u91cf\u7684\u7c7b\u578b\u3002<\/p>\n\n\n\n
          \u7a0b\u5e8f\u6267\u884c\u7ed3\u679c\u4e3a\uff1a<\/p>\n\n\n
          Found at index: 2<\/p>\n\n\n\n
          upper_bound() \u51fd\u6570\u8fd4\u56de\u6307\u5411\u7b2c\u4e00\u4e2a\u5927\u4e8e\u7ed9\u5b9a\u503c\u7684\u5143\u7d20\u7684\u8fed\u4ee3\u5668\u3002\u5982\u679c\u6240\u6709\u5143\u7d20\u90fd\u4e0d\u5927\u4e8e\u8be5\u503c\uff0c\u5219\u8fd4\u56de\u6307\u5411\u5e8f\u5217\u5c3e\u90e8\u7684\u8fed\u4ee3\u5668\u3002\u5982\u679c\u5b58\u5728\u591a\u4e2a\u7b49\u4e8e\u76ee\u6807\u503c\u7684\u5143\u7d20\uff0cupper_bound() \u51fd\u6570\u4f1a\u8df3\u8fc7\u5b83\u4eec\uff0c\u8fd4\u56de\u6307\u5411\u4e0b\u4e00\u4e2a\u5927\u4e8e\u7ed9\u5b9a\u503c\u7684\u5143\u7d20\u3002<\/p>\n\n\n\n
          \u4e0b\u9762\u662f\u4f7f\u7528 upper_bound() \u51fd\u6570\u7684\u793a\u4f8b\u4ee3\u7801\uff1a<\/p>\n\n\n\n
          #include <bits\/stdc++.h>\nusing namespace std;\nint main() {\n    vector<int> v = {1, 3, 5, 7, 9};   \/\/ \u5b9a\u4e49\u4e00\u4e2a\u6574\u6570\u7c7b\u578b\u7684\u5411\u91cf v\uff0c\u5e76\u521d\u59cb\u5316\u4e3a {1, 3, 5, 7, 9}\n    int val = 5;                       \/\/ \u5b9a\u4e49\u4e00\u4e2a\u6574\u6570\u53d8\u91cf val\uff0c\u5e76\u8d4b\u503c\u4e3a 5\n    auto it = upper_bound(v.begin(), v.end(), val);  \/\/ \u4f7f\u7528 upper_bound() \u51fd\u6570\u67e5\u627e\u5728\u6709\u5e8f\u5bb9\u5668 v \u4e2d\u7b2c\u4e00\u4e2a\u5927\u4e8e val \u7684\u5143\u7d20\u7684\u8fed\u4ee3\u5668\n    if (it != v.end())                 \/\/ \u5982\u679c\u627e\u5230\u4e86\u7b26\u5408\u6761\u4ef6\u7684\u5143\u7d20\n        cout << \"First element greater than \" << val << \" is at index: \" << it - v.begin();  \/\/ \u5219\u8f93\u51fa\u8be5\u5143\u7d20\u7684\u7d22\u5f15\uff08\u901a\u8fc7\u8ba1\u7b97\u8fed\u4ee3\u5668\u4e0e\u8d77\u59cb\u8fed\u4ee3\u5668\u7684\u5dee\u503c\uff09\n    else                               \/\/ \u5982\u679c\u6ca1\u6709\u627e\u5230\u7b26\u5408\u6761\u4ef6\u7684\u5143\u7d20\n        cout << \"No elements are greater than \" << val;  \/\/ \u5219\u8f93\u51fa \"No elements are greater than \" \u52a0\u4e0a val \u7684\u503c\n    return 0;                          \/\/ \u8fd4\u56de\u503c\n}<\/code><\/pre>\n\n\n\n
          \u7a0b\u5e8f\u7684\u6267\u884c\u7ed3\u679c\u4e3a\uff1a<\/p>\n\n\n
          First element greater than 5 is at index: 3<\/p>\n\n\n\n
          lower_bound() \u548c upper_bound() \u90fd\u5047\u5b9a\u8f93\u5165\u8303\u56f4\u662f\u6709\u5e8f\u7684\u3002\u5982\u679c\u5728\u65e0\u5e8f\u7684\u5e8f\u5217\u4e0a\u4f7f\u7528\u5b83\u4eec\uff0c\u5c06\u65e0\u6cd5\u4fdd\u8bc1\u7ed3\u679c\u6b63\u786e\u3002<\/p>\n\n\n\n
          \u4e3a\u4e86\u66f4\u76f4\u767d\u6bd4\u8f83\uff0clower_bound() \u548c upper_bound()\u7684\u5bf9\u6bd4\u56fe\u5982\u4e0b\uff1a<\/p>\n\n\n\n
          \u51fd\u6570<\/strong><\/th>lower_bound()<\/strong><\/th>upper_bound()<\/strong><\/th><\/tr><\/thead>
          \u529f\u80fd<\/td>\u67e5\u627e\u7b2c\u4e00\u4e2a\u4e0d\u5c0f\u4e8e\u7ed9\u5b9a\u503c\u7684\u5143\u7d20<\/td>\u67e5\u627e\u7b2c\u4e00\u4e2a\u5927\u4e8e\u7ed9\u5b9a\u503c\u7684\u5143\u7d20<\/td><\/tr>
          \u8fd4\u56de\u503c<\/td>\u8fed\u4ee3\u5668<\/td>\u8fed\u4ee3\u5668<\/td><\/tr>
          \u6761\u4ef6\u8981\u6c42<\/td>\u8f93\u5165\u7684\u5e8f\u5217\u5fc5\u987b\u662f\u6709\u5e8f\u7684<\/td>\u8f93\u5165\u7684\u5e8f\u5217\u5fc5\u987b\u662f\u6709\u5e8f\u7684<\/td><\/tr>
          \u65f6\u95f4\u590d\u6742\u5ea6<\/td>O(log n)<\/td>O(log n)<\/td><\/tr>
          \u8fd4\u56de\u5143\u7d20\u6761\u4ef6<\/td>\u5927\u4e8e\u6216\u7b49\u4e8e\u7ed9\u5b9a\u503c\u7684\u7b2c\u4e00\u4e2a\u5143\u7d20<\/td>\u5927\u4e8e\u7ed9\u5b9a\u503c\u7684\u7b2c\u4e00\u4e2a\u5143\u7d20<\/td><\/tr>
          \u8fd4\u56de\u503c\u4e3a end \u7684\u6761\u4ef6<\/td>\u6240\u6709\u5143\u7d20\u90fd\u5c0f\u4e8e\u7ed9\u5b9a\u503c<\/td>\u6240\u6709\u5143\u7d20\u90fd\u5c0f\u4e8e\u6216\u7b49\u4e8e\u7ed9\u5b9a\u503c<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
          3.equel_range<\/h3>\n\n\n\n
          equel_range() \u51fd\u6570\u7528\u4e8e\u5728\u6307\u5b9a\u8303\u56f4\u5185\u67e5\u627e\u7b49\u4e8e\u76ee\u6807\u503c\u7684\u6240\u6709\u5143\u7d20\u3002<\/p>\n\n\n\n
          \u503c\u5f97\u4e00\u63d0\u7684\u662f\uff0c\u5f53\u6307\u5b9a\u8303\u56f4\u5185\u7684\u6570\u636e\u652f\u6301\u7528 < \u5c0f\u4e8e\u8fd0\u7b97\u7b26\u76f4\u63a5\u505a\u6bd4\u8f83\u65f6\uff0c\u53ef\u4ee5\u4f7f\u7528\u5982\u4e0b\u683c\u5f0f\u7684 equel_range() \u51fd\u6570\uff1a<\/p>\n\n\n\n
          \/\/\u627e\u5230 [first, last) \u8303\u56f4\u4e2d\u6240\u6709\u7b49\u4e8e val \u7684\u5143\u7d20\npair<ForwardIterator,ForwardIterator> equal_range (ForwardIterator first, ForwardIterator last, const T& val);<\/code><\/pre>\n\n\n\n
          \u5982\u679c\u6307\u5b9a\u8303\u56f4\u5185\u7684\u6570\u636e\u4e3a\u81ea\u5b9a\u4e49\u7684\u7c7b\u578b\uff08\u7528\u7ed3\u6784\u4f53\u6216\u7c7b\uff09\uff0c\u5c31\u9700\u8981\u81ea\u5b9a\u4e49\u6bd4\u8f83\u89c4\u5219\uff0c\u8fd9\u79cd\u60c5\u51b5\u4e0b\u53ef\u4ee5\u4f7f\u7528\u5982\u4e0b\u683c\u5f0f\u7684 equel_range() \u51fd\u6570\uff1a<\/p>\n\n\n\n
          \/\/\u627e\u5230 [first, last) \u8303\u56f4\u5185\u6240\u6709\u7b49\u4e8e val \u7684\u5143\u7d20\npair<ForwardIterator,ForwardIterator> equal_range (ForwardIterator first, ForwardIterator last, const T& val, Compare comp);<\/code><\/pre>\n\n\n\n
          \u4ee5\u4e0a 2 \u79cd\u683c\u5f0f\u4e2d\uff0cfirst \u548c last \u90fd\u4e3a\u6b63\u5411\u8fed\u4ee3\u5668\uff0c[first, last) \u7528\u4e8e\u6307\u5b9a\u8be5\u51fd\u6570\u7684\u4f5c\u7528\u8303\u56f4\uff1bval \u7528\u4e8e\u6307\u5b9a\u76ee\u6807\u503c\uff1bcomp \u7528\u4e8e\u6307\u5b9a\u6bd4\u8f83\u89c4\u5219\uff0c\u6b64\u53c2\u6570\u53ef\u63a5\u6536\u4e00\u4e2a\u5305\u542b 2 \u4e2a\u5f62\u53c2\uff08\u7b2c\u4e8c\u4e2a\u5f62\u53c2\u503c\u59cb\u7ec8\u4e3a val\uff09\u4e14\u8fd4\u56de\u503c\u4e3a bool \u7c7b\u578b\u7684\u51fd\u6570\uff0c\u53ef\u4ee5\u662f\u666e\u901a\u51fd\u6570\uff0c\u4e5f\u53ef\u4ee5\u662f\u51fd\u6570\u5bf9\u8c61\u3002<\/p>\n\n\n\n
          \u540c\u65f6\uff0c\u8be5\u51fd\u6570\u4f1a\u8fd4\u56de\u4e00\u4e2a pair \u7c7b\u578b\u503c\uff0c\u5176\u5305\u542b 2 \u4e2a\u6b63\u5411\u8fed\u4ee3\u5668\u3002\u5f53\u67e5\u627e\u6210\u529f\u65f6\uff1a<\/p>\n\n\n\n
            \n
          1. \u7b2c 1 \u4e2a\u8fed\u4ee3\u5668\u6307\u5411\u7684\u662f [first, last) \u533a\u57df\u4e2d\u7b2c\u4e00\u4e2a\u7b49\u4e8e val \u7684\u5143\u7d20\uff1b<\/li>\n\n\n\n
          2. \u7b2c 2 \u4e2a\u8fed\u4ee3\u5668\u6307\u5411\u7684\u662f [first, last) \u533a\u57df\u4e2d\u7b2c\u4e00\u4e2a\u5927\u4e8e val \u7684\u5143\u7d20\u3002<\/li>\n<\/ol>\n\n\n\n
            \u53cd\u4e4b\u5982\u679c\u67e5\u627e\u5931\u8d25\uff0c\u5219\u8fd9 2 \u4e2a\u8fed\u4ee3\u5668\u8981\u4e48\u90fd\u6307\u5411\u5927\u4e8e val \u7684\u7b2c\u4e00\u4e2a\u5143\u7d20\uff08\u5982\u679c\u6709\uff09\uff0c\u8981\u4e48\u90fd\u548c last \u8fed\u4ee3\u5668\u6307\u5411\u76f8\u540c\u3002<\/p>\n\n\n\n
            \u9700\u8981\u6ce8\u610f\u7684\u662f\uff0c\u7531\u4e8e equel_range() \u5e95\u5c42\u5b9e\u73b0\u91c7\u7528\u7684\u662f\u4e8c\u5206\u67e5\u627e\u7684\u65b9\u5f0f\uff0c\u56e0\u6b64\u8be5\u51fd\u6570\u4ec5\u9002\u7528\u4e8e\u201c\u5df2\u6392\u597d\u5e8f\u201d\u7684\u5e8f\u5217\u3002\u6240\u8c13\u201c\u5df2\u6392\u597d\u5e8f\u201d\uff0c\u5e76\u4e0d\u662f\u8981\u6c42 [first, last) \u533a\u57df\u5185\u7684\u6570\u636e\u4e25\u683c\u6309\u7167\u67d0\u4e2a\u6392\u5e8f\u89c4\u5219\u8fdb\u884c\u5347\u5e8f\u6216\u964d\u5e8f\u6392\u5e8f\uff0c\u53ea\u8981\u6ee1\u8db3\u201c\u6240\u6709\u4ee4 element<val\uff08\u6216\u8005 comp(element,val\uff09\u6210\u7acb\u7684\u5143\u7d20\u90fd\u4f4d\u4e8e\u4e0d\u6210\u7acb\u5143\u7d20\u7684\u524d\u9762\uff08\u5176\u4e2d element \u4e3a\u6307\u5b9a\u8303\u56f4\u5185\u7684\u5143\u7d20\uff09\u201d\u5373\u53ef\u3002<\/p>\n\n\n\n
            \u5177\u4f53\u793a\u4f8b\u5982\u4e0b\uff1a<\/p>\n\n\n\n
            #include <iostream>     \/\/ std::cout\n#include <algorithm>    \/\/ std::equal_range\n#include <vector>       \/\/ std::vector\nusing namespace std;\n\/\/\u4ee5\u666e\u901a\u51fd\u6570\u7684\u65b9\u5f0f\u5b9a\u4e49\u67e5\u627e\u89c4\u5219\nbool mycomp(int i, int j) { return i > j; }\n\/\/\u4ee5\u51fd\u6570\u5bf9\u8c61\u7684\u5f62\u5f0f\u5b9a\u4e49\u67e5\u627e\u89c4\u5219\nclass mycomp2 {\npublic:\n    bool operator()(const int& i, const int& j) {\n        return i > j;\n    }\n};\nint main() {\n    int a[9] = { 1,2,3,4,4,4,5,6,7};\n    \/\/\u4ece a \u6570\u7ec4\u4e2d\u627e\u5230\u6240\u6709\u7684\u5143\u7d20 4\n    pair<int*, int*> range = equal_range(a, a + 9, 4);\n    cout << \"a[9]\uff1a\";\n    for (int *p = range.first; p < range.second; ++p) {\n        cout << *p << \" \";\n    }\n    vector<int>myvector{ 7,8,5,4,3,3,3,3,2,1 };\n    pair<vector<int>::iterator, vector<int>::iterator> range2;\n    \/\/\u5728 myvector \u5bb9\u5668\u4e2d\u627e\u5230\u6240\u6709\u7684\u5143\u7d20 3\n    range2 = equal_range(myvector.begin(), myvector.end(), 3,mycomp2());\n    cout << \"\\nmyvector\uff1a\";\n    for (auto it = range2.first; it != range2.second; ++it) {\n        cout << *it << \" \";\n    }\n    return 0;\n}<\/code><\/pre>\n\n\n\n
            \u7a0b\u5e8f\u6267\u884c\u7ed3\u679c\u4e3a\uff1a<\/p>\n\n\n
            a[9]\uff1a4 4 4
            \nmyvector\uff1a3 3 3 3<\/p>\n\n\n\n
            \u6b64\u7a0b\u5e8f\u4e2d\u6f14\u793a\u4e86 equal_range() \u51fd\u6570\u7684 2 \u79cd\u9002\u7528\u573a\u666f\uff0c\u5176\u4e2d a[9] \u6570\u7ec4\u4e2d\u5b58\u50a8\u7684\u4e3a\u5347\u5e8f\u5e8f\u5217\uff1b\u800c myvector \u5bb9\u5668\u4e2d\u5b58\u50a8\u7684\u5e8f\u5217\u867d\u7136\u6574\u4f53\u662f\u4e71\u5e8f\u7684\uff0c\u4f46\u5bf9\u4e8e\u76ee\u6807\u5143\u7d20 3 \u6765\u8bf4\uff0c\u6240\u6709\u7b26\u5408 mycomp2(element, 3) \u89c4\u5219\u7684\u5143\u7d20\u90fd\u4f4d\u4e8e\u5176\u5de6\u4fa7\uff0c\u4e0d\u7b26\u5408\u7684\u5143\u7d20\u90fd\u4f4d\u4e8e\u5176\u53f3\u4fa7\uff0c\u56e0\u6b64 equal_range() \u51fd\u6570\u4ecd\u53ef\u6b63\u5e38\u6267\u884c\u3002<\/p>\n\n\n\n
            \u5b9e\u9645\u4e0a\uff0cequel_range() \u51fd\u6570\u7684\u529f\u80fd\u5b8c\u5168\u53ef\u4ee5\u770b\u505a\u662f lower_bound() \u548c upper_bound() \u51fd\u6570\u7684\u5408\u4f53\u3002<\/p>\n\n\n\n
            \u597d\u4e86\uff0c\u4eca\u5929\u6211\u4eec\u5c31\u5148\u5b66\u5230\u8fd9\u91cc\uff0c\u5927\u5bb6\u4e00\u5b9a\u8981\u7ecf\u5e38\u6e29\u4e60\u54e6\uff0c\u6211\u4eec\u4e00\u8d77\u8fdb\u6b65\uff01<\/p>\n","protected":false},"excerpt":{"rendered":"
            \u6b64\u7cfb\u5217\u7528\u4e8e\u4ecb\u7ecdSTL\u5e93\u4e2dalgorithm\u4e2d\u6240\u6709\u7ade\u8d5b\u5e38\u7528\u7684\u7b97\u6cd5\uff0c\u65b9\u4fbf\u5927\u5bb6\u7ade\u8d5b\u4e2d\u53ef\u4ee5\u5feb\u901f\u7684\u5b9e\u73b0\u67d0\u4e2a\u529f\u80fd\uff0c\u5efa\u8bae\u5927\u5bb6 […]<\/p>\n","protected":false},"author":1,"featured_media":254,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[16,1,12],"tags":[],"class_list":["post-246","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-stl-algorithm","category-article","category-programming-algorithm-road"],"_links":{"self":[{"href":"https:\/\/jiangqvweihuan.cn\/index.php\/wp-json\/wp\/v2\/posts\/246","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/jiangqvweihuan.cn\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/jiangqvweihuan.cn\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/jiangqvweihuan.cn\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/jiangqvweihuan.cn\/index.php\/wp-json\/wp\/v2\/comments?post=246"}],"version-history":[{"count":6,"href":"https:\/\/jiangqvweihuan.cn\/index.php\/wp-json\/wp\/v2\/posts\/246\/revisions"}],"predecessor-version":[{"id":259,"href":"https:\/\/jiangqvweihuan.cn\/index.php\/wp-json\/wp\/v2\/posts\/246\/revisions\/259"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/jiangqvweihuan.cn\/index.php\/wp-json\/wp\/v2\/media\/254"}],"wp:attachment":[{"href":"https:\/\/jiangqvweihuan.cn\/index.php\/wp-json\/wp\/v2\/media?parent=246"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/jiangqvweihuan.cn\/index.php\/wp-json\/wp\/v2\/categories?post=246"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/jiangqvweihuan.cn\/index.php\/wp-json\/wp\/v2\/tags?post=246"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}