C++ 刷题 必备STL函数
end();
v.push_back(1);
v.pop_back()
int a = *(v.rbegin())
remove(v.begin(), v.end(), val);
v.erase(v.begin()+2);
v.erase(v.end()-1);
v.insert(v.begin(),1);
v.insert(v.begin(),5,1);
v.insert(v.begin() + i, k);
v.insert(v.begin(), v2.begin(), v2.end());
v.resize(10);
v.resize(10,1);
reverse(v.begin(), v.end());
sort(vec.begin(), vec.end());
for(auto it=vector.rbegin(); it != vector.rend(); it++)
string s = "234"; s += "world"; s.append("哇塞");
s.append(n,'0')
s.append(ss, 2, 3)
s.insert(2,"hello")
s.replace(2, 6, "xxx");
s.push_back(i)
s.pop_back();
s.back();
s.substr(a,b)
s.substr(num)
stack<int> sta;
sta.top();
sta.pop();
sta.push();
sta.size();
sta.empty();
q.push(elem);
q.pop();
q.back();
q.front();
set<int> set1;
set<int> set2 (set1.begin(), set1.end());
set<int> set6 {1,2,10,10};
set.size();
set.insert(elem);
set.find(key);
set.count(key);
set.erase(elem/iter);
for(auto x:set)
unordered_set<int> set1;
unordered_set<int> set1(nums1.begin(), nums1.end());
set1.find(x)
set1.insert(x)
set1.erase(elem);
if (m.find(key) != m.end()) {
map<int,string> m; unordered_map<int,string> um
m.insert(pair<int,string>(0,"wodennn"));
m.insert(make_pair(i, j))
m[4] = "ddddd";
auto it = m.find(5);
auto it = m.begin();
while(auto it!=m.end())
{
cout<< it->first << it->second <<endl;
it++;
}
for(it=m.begin(); it!= m.end(); it++)
{
cout<< it->first << it->second <<end;
}
for(auto it=m.rbegin(); it != m.rend(); it++)
{
cout<< it->first << it->second <<end;
}
for(auto &e : m)
{
cout<< e.first << e.second << endl;
}