Vector容器
介绍:vector相当于一个动态的数组,是一个单口容器,再分配空间时,vector会分配一些额外的空间以适应可能的增长,储存空间比实际要存储的空间更大。
原理:即动态增长,当插入新元素时,如果空间不足,那么vector会重新申请一块更大的内存空间(默认时原来空间的两倍),然后将原来空间的数据拷贝到新的空间,最后释放原来空间,再把新元素插入空间。
与数组相比:vector采用连续存储空间来存储元素。所以可以采用下标的方式vector的元素进行访问,和数组一样的高效。但是其又不像数组,它的大小是可以动态改变的,而且它的大小会被容器自己处理
常用API
vector的构造函数
//无参构造
vector ();
//构造并初始化n个val
vector (size_type n, const value_type& val = value_type());
//使用迭代器的范围构造
vector (Inputiterator first, Inputiterator last);
//拷贝构造
vector (const vector& x);
例:
#include<iostream>
#include<vector>
using namespace std;
int main()
{
vector<int> first;//int型空vector
vector<int> second(4, 100);//int型4个100的vector
vector<int> third(second.begin(), second.end());//通过迭代器构造
vector<int> fourth(third);//拷贝构造
//迭代器初始化构造vector
int myints[] = {1, 2, 3, 4};
vector<int> fifth(myints, myints + sizeof(myints) / sizeof(int));
for(vector<int>::iterator it = fifth.begin(); it != fifth.end(); ++it)
{
cout<<*it<<" ";
}
cout<<endl;
return 0;
}
迭代器iterator
- begin()+end():获取第一个数据位置的iterator/const_iterator,获取最后一个数据的下一个位置的
- iterator/const_iterator
rbegin()+rend():获取最后一个数据位置的rbegin(),获取第一个数据的前一个位置的rend()
#include<iostream>
#include<vector>
using namespace std;
void PrintVector(const vector<int>& v)
{
cout<<"const_iterator:";
for(vector<int>::const_iterator cit = v.begin(); cit != v.end(); ++cit)
{
cout<<*cit<<" ";
}
cout<<endl;
}
int main()
{
//构造空容器,插入数据
vector<int> v;
for(int i = 1; i < 10; ++i)
{
v.push_back(i);
}
//使用迭代器遍历打印
cout<<"iterator:";
for(vector<int>::iterator it = v.begin(); it != v.end(); ++it)
{
cout<<*it<<" ";
}
cout<<endl;
//使用迭代器修改
for(vector<int>::iterator it = v.begin(); it != v.end(); ++it)
{
(*it) *= 2;
}
//使用反向迭代器遍历打印
cout<<"reverse_iterator:";
for(vector<int>::reverse_iterator rit = v.rbegin(); rit != v.rend(); ++rit)
{
cout<<*rit<<" ";
}
cout<<endl;
//const对象使用const迭代器遍历打印
PrintVector(v);
return 0;
}
容量空间
- size()
- capacity()
- empty()
- resize()
- reserve()
注:capacity在vs下按1.5倍增长,在g++下按2倍增长。顺序表增容是根据具体需求定义的。
例:
#include<iostream>
#include<vector>
using namespace std;
void testCapacity()
{
vector<int> v;
size_t sz = v.capacity();
for(int i = 0; i < 100; ++i)
{
v.push_back(i);
if(sz != v.capacity())
{
sz = v.capacity();
cout<<"[testCapacity]capacity changed:"<<sz<<endl;
}
}
}
void testReserve()
{
vector<int> v;
size_t sz = v.capacity();
v.reserve(100);
for(int i = 0; i < 100; ++i)
{
v.push_back(i);
if(sz != v.capacity())
{
sz = v.capacity();
cout<<"[testReserve]capacity changed:"<<sz<<endl;
}
}
}
void testResize()
{
vector<int> v;
for(int i = 1; i < 10; ++i)
{
v.push_back(i);
}
cout<<"[testResize]size channged:"<<v.size()<<endl;
v.resize(5);
cout<<"[testResize]size channged:"<<v.size()<<endl;
for(vector<int>::iterator it = v.begin(); it != v.end(); ++it)
{
cout<<*it<<" ";
}
cout<<endl;
v.resize(8, 100);
cout<<"[testResize]size channged:"<<v.size()<<endl;
for(vector<int>::iterator it = v.begin(); it != v.end(); ++it)
{
cout<<*it<<" ";
}
cout<<endl;
v.resize(12);
cout<<"[testResize]size channged:"<<v.size()<<endl;
for(vector<int>::iterator it = v.begin(); it != v.end(); ++it)
{
cout<<*it<<" ";
}
cout<<endl;
}
int main()
{
testCapacity();
testReserve();
testResize();
return 0;
}
增删查改
push_back(value_type val):尾插
pop_back():尾删
find(iterator begin, iterator end, value_type val):查找(不是vector成员接口,属于算法模块实现)
insert(iterator pos, value_type val):在pos之前插入val
erase(iterator pos):删除pos数据
swap():交换两个vector数据空间
operator[]:数组一样访问
例:
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
void testPushPop()
{
int arr[] = {1, 2, 3, 4, 5, 6, 7};
vector<int> v(arr, arr + sizeof(arr)/sizeof(int));
for(vector<int>::iterator it = v.begin(); it != v.end(); ++it)
{
cout<<*it<<" ";
}
cout<<endl;
for(int i = 8; i <= 12; ++i)
{
v.push_back(i);
}
for(vector<int>::iterator it = v.begin(); it != v.end(); ++it)
{
cout<<*it<<" ";
}
cout<<endl;
v.pop_back();
v.pop_back();
for(vector<int>::iterator it = v.begin(); it != v.end(); ++it)
{
cout<<*it<<" ";
}
cout<<endl;
}
void testFindInsertErase()
{
int arr[] = {1, 2, 3, 4, 5, 6, 7};
vector<int> v(arr, arr + sizeof(arr)/sizeof(int));
for(vector<int>::iterator it = v.begin(); it != v.end(); ++it)
{
cout<<*it<<" ";
}
cout<<endl;
vector<int>::iterator pos = find(v.begin(), v.end(), 4);
v.insert(pos, 0);
for(vector<int>::iterator it = v.begin(); it != v.end(); ++it)
{
cout<<*it<<" ";
}
cout<<endl;
pos = find(v.begin(), v.end(), 4);
v.erase(pos);
for(vector<int>::iterator it = v.begin(); it != v.end(); ++it)
{
cout<<*it<<" ";
}
cout<<endl;
}
void testVisit()
{
int arr[] = {1, 2, 3, 4, 5, 6, 7};
vector<int> v(arr, arr + sizeof(arr)/sizeof(int));
for(int i = 0; i < v.size(); ++i)
{
cout<<v[i]<<" ";
}
cout<<endl;
vector<int> tmp;
tmp.swap(v);
for(int i = 0; i < tmp.size(); ++i)
{
cout<<tmp[i]<<" ";
}
cout<<endl;
for(auto x : tmp)
{
cout<<x<<" ";
}
cout<<endl;
}
int main()
{
testPushPop();
testFindInsertErase();
testVisit();
return 0;
}
缩放空间(利用swap())
因为在添加或者元素时,vector的实际空间大小与元素的个数是不一样的,实际空间总会超出元素个数的大小,并且删除元素时vector的实际容量不会自动缩小造成空间的浪费
解决:
用匿名对象与其互换空间的办法缩减空间。
#include<iostream>
#include<vector>
using namespace std;
int main()
{
vector<int> v;
for(int i=0;i<100000;i++)
{
v.push_back(i);
}
cout << v.size() << endl;
cout << v.capacity() << endl;
cout << "<-------------->" << endl;
v.resize(10);cout << v.size() << endl;
cout << v.capacity() << endl;
}
上述说明vector不会自动缩减内存空间
//使用匿名对象
vector<int>(v).swap(v);
cout << "<-------------->" << endl;
cout << v.size() << endl;
cout << v.capacity() << endl;
匿名对象的声明周期只在本行代码,当本行代码运行结束后,系统会自动调用析构函数,对其空间进行释放内存,这样用v的元素初始化的匿名对象的空间大小与数据与v交换就实现了空间的缩减