20200,蓝桥杯支持使用C++11了
stl 常见的库函数:
查找函数:头文件
#include <algorithm>
int count(_InIt _First, _InIt _Last, const _Ty& _Val);
count(vs.begin(),vs.end(),"fdsf");
排序函数:头文件:
#include <algorithm>
//对范围内升序
sort(a, a+a.size() , mycomp);
sort(myvector.begin(), myvector.end() , mycomp);
//合并两个容器,不排序
void merge(myvector.begin(),myvector.end(),list.begin(),list.end(),v.begin());
运算函数: 头文件:
#include <algorithm>
max(),min(),swap()
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <string>
using namespace std;
bool mycomp(int i, int j) {
return (i > j);
}
int main(int argc, char** argv) {
#include <algorithm>
vector<int> myvector,v;
myvector.push_back(32);
myvector.push_back(45);
myvector.push_back(34);
myvector.push_back(37);
myvector.push_back(28);
myvector.push_back(56);
myvector.push_back(24);
vector<int> list;
list.push_back(34);
list.push_back(43);
list.push_back(56);
list.push_back(65);
list.push_back(90);
list.push_back(9);
vector<string> vs;
vs.push_back("fdsf");
vs.push_back("fdsf");
vs.push_back("fdsf");
vs.push_back("fdsf");
vs.push_back("fdsf");
/*
不要问为什么不用vector<int> list={34,43,56,65,90};
我c++98 不允许
*/
sort(myvector.begin(), myvector.end() , mycomp);
for(int i=0;i<myvector.size();i++){
cout<<myvector[i]<<' ';
}
cout<<endl;
reverse(myvector.begin(),myvector.end());
for(int i=0;i<myvector.size();i++){
cout<<myvector[i]<<' ';
}
//merge(myvector.begin(),myvector.end(),list.begin(),list.end(),v.begin());
cout<<count(vs.begin(),vs.end(),"fdsf");
#include <numeric>
swap(list[0],myvector[0]);
}