#include<iostream>
#include<vector>
using namespace std;
void print(vector<int> &v)
{
vector<int>::iterator it_s = v.begin(); //迭代器,begin函数,返回的是容器的头元素
vector<int>::iterator it_e = v.end(); // end,返回容器尾元素
while(it_s != it_e)
{
cout<<*it_s<<" ";
it_s++;
}
cout<<endl;
}
int main()
{
int array[] = {1,2,3,4,5};
vector<int> v(array,array + 5);
print(v);
vector<int> v2(v);
print(v2);
//v2.push_back(10);
v2.emplace_back(20);//原地构造,省去拷贝构造的过程
print(v2);
v2.insert(v2.begin() + 1,90);
print(v2);
v2.insert(v2.begin() + 2,3,99);
print(v2);
v2.insert(v2.begin()+1,v.begin(),v.end());
v2.emplace(v2.begin()+ 1,1);
print(v2);
// cout<<v2.at(2)<<endl;//越界报错
// cout<<v2[2]<<endl;
// cout<<v2.front()<<endl;//返回头元素
// cout<<v2.back()<<endl;//返回最后一个元素
v2.pop_back();//删除尾部数据
print(v2);
// v2.clear();//全部删除
// print(v2);
v2.erase(v2.begin()+1,v2.begin()+ 11);
print(v2);
v2.erase(v2.begin()+5,v2.end());
print(v2);
for(auto it = v2.begin();it < v2.end();)
{
if(*it == 99)
{
v2.erase(it,it+1);
}
else
{
it++;
}
}
print(v2);
cout<<*(v2.end() -2)<<endl;
cout<<*(v2.rend() -2)<<endl;
cout<<v.size()<<endl;//输出元素个数
//v2.clear();
if(v2.empty())
{
cout<<"容器为空"<<endl;
}
else
{
cout<<"容器不为空"<<endl;
}
cout<<v2.size()<<endl;
cout<<v2.capacity()<<endl;//容器的容量(大于等于size)
cout<<"删除空间之后"<<endl;
v2.shrink_to_fit();//删除多余的空间
cout<<v2.capacity()<<endl;
print(v2);
v2.resize(10,99);//扩增size而不是容量,扩增的赋值为99
cout<<v2.size()<<endl;
cout<<v2.capacity()<<endl;
print(v2);
v2.resize(6);//不仅可以扩大,也可以删减,size个数变小,不会影响容量
cout<<v2.size()<<endl;
cout<<v2.capacity()<<endl;
print(v2);
v2.reserve(20);//不改变元素个数,会扩展新的容量空间
cout<<v2.size()<<endl;
cout<<v2.capacity()<<endl;
print(v2);
v2.assign(4,100);//覆盖性赋值
print(v2);
return 0;
}