C++容器--vector

     

     #include <iostream>
     #include <vector>
     #include <algorithm>
     using namespace std;


     //1.容器的遍历
void printV(vector<int> &v)
{
vector<int>::iterator it = v.begin();
while(it != v.end())
{
printf("%d ",*it);
it++;
}
cout << endl;
}
//2.构造,尾部插入
void func1()
{
vector<int> v1;//空的容器
vector<int> v2(10);//有10个元素的容器


cout << "v2: " << v2.size() << endl;
v2.push_back(1);//尾部插入数据
v2.push_back(2);


cout << "v2: " << v2.size()<< endl;
printV(v2);


vector<int> v3(10,2);//结果是10个2
printV(v3);


vector<int> v4 = v3;//拷贝构造
printV(v4);


v2 = v3;//赋值
printV(v2);


vector<int> v5(v3.begin(),v3.begin()+5);//用v3的部分数据


进行初始化
printV(v5);


cout << v5.size()<< endl;//5


v5.resize(10);//改变空间的大小


cout << v5.size() << endl;//10
}


//3.访问


void func2()
{
vector<int> v;
v.push_back(1);
v.push_back(22);
v.push_back(2);
v.push_back(9);
v.push_back(8);


//反向迭代器
vector<int>::reverse_iterator it = v.rbegin();//容器的最


后一个元素
while(it != v.rend())
{
cout<< *it << " ";
it++;
}
cout << endl;


//支持下标访问
v[0] = 10;
printV(v);


v.at(3) = 123;
printV(v);


cout << v.front() << endl;
cout << v.back() << endl;


v.front() = 8;
v.back() = 4;


while(!v.empty())
{
cout << v.back() << " ";
v.pop_back();//删除容器中最后一个元素
}


}


//4.删除
void func3()
{
vector<int> v;
v.push_back(1);
v.push_back(22);
v.push_back(2);
v.push_back(9);
v.push_back(8);


v.erase(v.begin());
v.erase(v.begin(),v.begin()+1);
printV(v);


v.clear();


vector<int> v1;
v1.push_back(1);
v1.push_back(22);
v1.push_back(2);
v1.push_back(9);
v1.push_back(8);


//释放v1,先定义一个空的容器，将当前容器和其进行交换


vector<int> v2;
v1.swap(v2);
printV(v2);
}
//5.删除某个值
void func4()
{
vector<int> v;
v.push_back(1);
v.push_back(22);
v.push_back(2);
v.push_back(9);
v.push_back(8);
v.push_back(8);
v.push_back(8);
v.push_back(8);
v.push_back(8);

vector<int>::iterator it = v.begin();
while(it != v.end())
{
if(*it == 8)
it = v.erase(it);//删除的返回值是下一个数


据的迭代器
else
it++;
}
printV(v);
}


//6.插入 
void func5()
{
vector<int> v;
v.push_back(1);
v.push_back(32);
v.push_back(83);
v.push_back(18);
v.push_back(3);
v.push_back(8);

v.insert(v.begin(),123);//中间插入
v.push_back(456);//尾部插入


v.insert(v.begin()+4,4);
printV(v);


vector<int> v1;
v1.push_back(1);
v1.push_back(2);
v1.push_back(3);
v1.insert(v1.begin()+1,v.begin(),v.end());
printV(v1);


//逆序
reverse(v1.begin(),v1.end());
printV(v1);


//排序
sort(v1.begin(),v1.end(),greater<int>());
printV(v1);
}


int main()
{
func5();
return 0;
}