vector<int> v1;          //創(chuàng)建int類型順序表 v1;
vector<char> v2;         //創(chuàng)建char類型順序表 v2;
vector<double> v3;       //創(chuàng)建double類型順序表 v3;

vector<int> v1(10,9);    //創(chuàng)建int類型順序表v1,里面有10個9;
vector<int> v2(v1.begin(),v1.begin()+6);   //創(chuàng)建int類型順序表v2,里面有6個9;

vector<int> v1(10,9);    //創(chuàng)建int類型順序表v1,里面有10個9;
vector<int> v2(v1.begin(),v1.begin()+6);   //創(chuàng)建int類型順序表v2,里面有6個9;

vector<char> v1(10,9);   //通過前面的方法創(chuàng)建一個對象;
vector<char> v2(v1);     //創(chuàng)建對象v2,其內(nèi)容與v1一模一樣.

vector<int> v1;
v1.push_back(1);
v1.push_back(2);
v1.push_back(3);
v1.push_back(4);    //這四個步驟大概意思為插入 1 2 3 4
vector<int>::iterator it = v1.begin();
while(it != v1.end()) 
{
    cout<<*it<<" ";
}
cout<<endl;              //到這一步會輸出 1 2 3 4
it = v1.rbegin();
while(it != rend())
{
    cout<<*it<<" ";
}
cout<<endl;              //到這一步會輸出4 3 2 1

vector<int> v1;    //先創(chuàng)建一個對象.
v1.push_back(1);   //尾插數(shù)據(jù)1
v1.push_back(2);   //尾插數(shù)據(jù)2
v1.push_back(3);   //尾插數(shù)據(jù)3
// 現(xiàn)在v1的數(shù)據(jù)內(nèi)容情況為 1  2  3

vector<int> v1;
v1.push_back(1);
v1.push_back(2);
v1.push_back(3);
v1.push_back(4);
v1.pop_back();  //尾刪元素4
v1.pop_back();  //尾刪元素3
v1.pop_back();  //尾刪元素2
//目前該容器還剩下元素 1

vector<int> v1;
v1.push_back(1);
v1.push_back(2);
v1.push_back(3);
v1.push_back(4);
v1.erase(v1.begin());      //刪除第一個元素1
v1.erase(v1.begin()+1);    //刪除現(xiàn)在容容器的第二個元素3
//目前還剩下元素2 4

vector<int> v1;
v1.push_back(1);
v1.push_back(2);
v1.push_back(3);
v1.push_back(4);
v1.size();   //獲取到元素數(shù)量為4個

vector<int> v1;
v1.push_back(1);
v1.push_back(2);
v1.push_back(3);
v1.push_back(4);
v1.resize(3,0);   //只會縮減到3個size,傳入的另一個0無效
v1.resize(6,9);   //現(xiàn)在6大于size:3,所以9有效
//現(xiàn)在內(nèi)容為1 2 3 9 9 9 

vector<int> v1;
v1.capacity();  //注意哦~,這個容量和size并不一樣.

vector<int> v1;
if(v1.empty())
{
    cout<<"容易為空"<<endl;
}
else
{
    cout<<"容器不為空"<<endl;
}