//构造函数
//explicit vector(const _Alloc& _Al)
vector<int> v1;
//explicit vector(size_type _Count)
vector<double> v2(12);
//vector(size_type _Count, const value_type& _Val)
vector<double> v3(10, 1.3);
//vector(const _Myt& _Right)
vector<char> v4(2, 'k');
vector<char> v5(v4);
//vector(_Iter _First, _Iter _Last)
int array[] = { 11, 2, 34, 443, 39 };
vector<int> v6(array, array + 5);
//添加元素
vector<int> v7;
v7.push_back(3);
//使用下标遍历
vector<int> v8(3, 12);
for (size_t i = 0; i < v8.size(); ++i)
{
cout << "v[" << i << "]=" << v8[i] << endl;
}
//使用迭代器遍历
vector<int> v9(4, 1);
vector<int>::iterator iter;
size_t j;
for (iter = v9.begin(), j = 0; iter != v9.end(); ++iter, ++j)
{
cout << "v[" << j << "]=" << *iter << endl;
}
//反向遍历
vector<int>::reverse_iterator riter;
size_t k = v9.size() - 1;
for (riter = v9.rbegin(); riter != v9.rend(); ++riter, --k)
{
cout << "v[" << k << "]=" << *riter << endl;
}
//插入元素
vector<int> v10(3, 22);
v10.insert(v10.begin(), 8);
//删除元素
vector<int> v11(3, 123);
v11.erase(v11.begin());
vector<int> v12(4, 21);
v12.push_back(123);
v12.insert(v12.begin(), 1);
v12.erase(v12.begin(), v12.begin() + 3); //21 21 123
//交换两个容器
v12.swap(v11);
//容器是否为空
bool b = v12.empty();
//实际元素个数
size_t count = v12.size();
//容器最大元素个数
size_t max_count = v12.max_size();
//当前可容纳元素个数
size_t cap_count = v12.capacity();
//首元素,要求容器不为空
int vFront = v12.front();
//末元素,要求容器不为空
int vEnd = v12.back();
//删除末尾的一个元素
v12.pop_back();
//清空元素
v12.clear();