find尋找特定元素位置

int main(char argc, int* argv[]) {vector<int> intVec = { 0,1,1,1,1,2,3,4,5,6,7,8,9 };if (pos != intVec.end())cout << "The value 5 exists,and its position is " <<distance(intVec.begin(), pos) + 1 << endl;elsecout << "The value 4 not found!" << endl;getchar();return 0;
}

std::unique 與erase組合：去除重復(fù)元素

unique去除返回迭代器位置（首先需要sort 數(shù)組排序）

vector<string> wordVec = { "the","quick","red","fox","jnmp","slow","over","the","red" };std::sort(wordVec.begin(), wordVec.end());//fox jnmp over quick red red slow the theauto end_unique =std::unique(wordVec.begin(), wordVec.end());wordVec.erase(end_unique, wordVec.end());//fox jnmp over quick red slow the//                                 end_unique位置指向第一個(gè)the末尾

謂詞：可調(diào)用表達(dá)式，返回解結(jié)果可作為條件的值

stable_sort 穩(wěn)定排序算法

• 一元謂詞 ： 接受單一的參數(shù)
• 二元謂詞 : 接受2個(gè)參數(shù)

bool isShorter(const string& s1, const string& s2) {return s1.size() < s2.size();
}int main(char argc, int* argv[]) {vector<string> wordVec = { "the","quick","red","fox","jnmp","slow","over","the","red" };std::stable_sort(wordVec.begin(), wordVec.end(), isShorter);//the red fox the red jnmp slow over quickreturn 0;
}

可調(diào)用對(duì)象 ：4種

函數(shù) 函數(shù)指針 重載了函數(shù)調(diào)用的類 lamda表達(dá)式

• “-”
  • “+”
    • “*”

總結(jié)

以上是生活随笔為你收集整理的【C++】algorithm具体操作记录的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。