#include <iostream>
using namespace std;
#include "vector"
void main31()
{
vector<int> v1;
cout << "length:" << v1.size() << endl;
v1.push_back(1);//push_back(obj)尾部压入obj的意思
v1.push_back(3);
v1.push_back(5);
cout << "length:" << v1.size() << endl;
//修改头部元素的值
v1.front() = 11;
v1.back() = 55;
while (v1.size()>0)
{
cout << "尾部元素" << v1.back() << endl;
v1.pop_back();
}
}
//vector初始化
void main32()
{
vector<int> v1;
v1.push_back(1);
v1.push_back(3);
v1.push_back(5);
v1.push_back(7);
vector<int> v2=v1;
vector<int> v3(v1.begin(),v1.begin()+2);
}
//vector遍历
void printV(vector<int> v1)
{
for(int i = 0; i < v1.size(); i++)
{
cout << v1[i] << " ";
}
cout << endl;
}
void main33()
{
vector<int> v1(10);//使用[]时,要预先给v1申请内存空间。push_back()则是新加内存空间
for(int i = 0; i < v1.size(); i++)
{
v1[i] = i + 1;
}
v1.push_back(11);
v1.push_back(12);
printV(v1);
}
void main34()
{
vector<int> v1(10);//使用[]时,要预先给v1申请内存空间。push_back()则是新加内存空间
for (int i = 0; i < v1.size(); i++)
{
v1[i] = i + 1;
}
//正向遍历
for (vector<int>::iterator it = v1.begin(); it != v1.end(); it++)
{
cout << *it << " ";
}
cout << endl;
//逆向遍历
for (vector<int>::reverse_iterator rit = v1.rbegin(); rit != v1.rend(); rit++)
{
cout << *rit << " ";
}
}
//vector 删除和插入
//删除
void main35()
{
vector<int> v1(10);
for (int i = 0; i < v1.size(); i++)
{
v1[i] = i + 1;
}
//区间删除
v1.erase(v1.begin(), v1.begin() + 2);
printV(v1);
vector<int> v2(10);
for (int i = 0; i < v2.size(); i++)
{
v2[i] = i + 1;
}
//指定位置删除
v2.erase(v2.begin() + 2);
printV(v2);
vector<int> v3(10);
for (int i = 0; i < v3.size(); i++)
{
v3[i] = i + 1;
}
//指定值的删除
for (vector<int>::iterator iit = v3.begin(); iit != v3.end();)
{
if (*iit == 2)
{
iit=v3.erase(iit);//匹配删除iit后,iit会自动指向下个元素 需要iit再接回去
}
else
{
iit++;
}
}
printV(v3);
}
//插入
void main36()
{
vector<int> v1(10);
for (int i = 0; i < v1.size(); i++)
{
v1[i] = i + 1;
}
v1.insert(v1.begin(), 3);
v1.insert(v1.end(),2);
printV(v1);
}
void main()
{
// main31();
// main32();
// main33();
// main34();
// main35();
main36();
system("pause");
}
c++ vector
最新推荐文章于 2024-03-07 21:48:19 发布