string

構造

新增

刪除

替換

查詢(find,rfind)

比較

大小

遍歷

普遍

string s；

+=

s.clear();

find("a b c");

compare(s)

size();
length();
capacity();
max_size();
empty();

for(0 - length())
s[i]

for(0 - length())
s.at(i)

string::iterator i
for(begin()-end())
*i;

string s("a b c");
string s(n,'c');

append(n,'c');

s.pop_back()

find_first(last)_of("a b")

compare("a b")

string s(s1);

push_back()

find_first(last)_not_of("a b")

location

insert(index,'c');
insert(index,s2);
insert(index,"abc");

find('c'(,index));

pos,n

string s(s1,pos,n);

erase(pos(,n));

replace(pos,n,(a,)"a b c");

compare(pos,n,s);

first,last

string s(s1,first,last);

erase(first,last);

replace(first,last,"a b c");

操作物件

目的

strcpy

字串

拷貝字串

sprintf

任意基本型別的資料

基本資料型別向字串的轉換

memcpy

任意資料型別

記憶體拷貝

vector

構造

賦值

新增

刪除

大小

遍歷

普遍

vector a(n(,num));
voctor<int>a={1,2,3};

push_back();

a.clear();

size();
capacity();
max_size();
empty();

for(0 - length())
s[i]

for(0 - length())
s.at(i)

string::iterator i
for(begin()-end())
*i;

vector<int>a(b);

assign(n,elem);

a.pop_back()

location

insert(position,(n,)elem);

erase(location);

first,last

vector a(b,b+n);
注意：這裡和string不一樣，不是a(b.begin(),b.end())

assign(b.first,b.last)

insert(position,b.first,b.last)

erase(first,last);

pos,n

為什麼vector不用這招了呢？

deque

構造

賦值

新增

刪除

大小

普遍

deque<T> c;

push_back(elem)

pop_back()

size();
max_size();
resize(n(,elem));
empty();

deque<T> c(c2);

push_front(elem)

pop_front()

deque<T> c(n,elem);

assign(n,elem);

clear();

location

insert(position,(n,)elem);(n個)

erase(location);

first,last

deque<T> c(first,last);

assign(first,last);

insert(position,b.first,b.last);

erase(first,last);