标签：lis iterator 常用 bsp 结构 highlight queue pop +=
string:
string substr(int pos , int n) ; int find(string s , int pos) ; int find(char c , int pos) ; int find_first_of(strng s , int pos) ;
int find_first_of(string s , int pos) ;
char back() ;
push_back() ; pop_back();
+=
vector:
stack:
empty top() ; pop() ; push() ;
queue:
empty() ; front() ; pop() ; push() ;
priority_queue:
push pop top();
map:
count erase
lower_bound
upper_bound
erase
deque:
push_back push_front() pop_back() pop_front()
unordered_map:
set:
unordered_set:
list:
begin() end() front() back() push_front() pop_front() push_back() pop_back() insert(iterator , val) iterator erase(iterator)
标签：lis iterator 常用 bsp 结构 highlight queue pop +=
原文地址：https://www.cnblogs.com/mychen06/p/12690278.html
