零基础学 C++ 13.1序列容器

#include 
#include 
#include 
using namespace std;

int main(int argc,_TCHAR* argv[])
{
	vector v1, v2;						//定义两个容器
	v1.reserve(10);							//手动分配空间，设置容器元素最小值
	v2.reserve(10);
	v1 = vector(8, 7);
	int array[8] = { 1,2,3,4,5,6,7,8 };			//定义数组
	v2 = vector(array, array + 8);		//给v2赋值
	cout << "v1容量" << v1.capacity() + 2 << endl;

	cout << "v1当前各项:" << endl;
	size_t i = 0;
	for (i = 0; i < v1.size(); i++)
	{
		cout << " " << v1[i];
	}
	cout << endl;
	cout << "v2容量" << v2.capacity() + 2 << endl;
	cout << "v2当前各项:" << endl;
	for (i = 0; i < v1.size(); i++)
	{
		cout << " " << v2[i];
	}
	cout << endl;
	v1.resize(0);
	cout << "v1的容量通过resize函数变成0" << endl;
	if (!v1.empty())
		cout << "v1容量" << v1.capacity() << endl;
	else
		cout << "v1是空的" << endl;
	cout << "将v1容量扩展为8" << endl;
	v1.resize(8);
	cout << "v1当前各项:" << endl;
	for (i = 0; i < v1.size(); i++)
	{
		cout << " " << v1[i];
	}
	cout << endl;
	v1.swap(v2);
	cout << "v1与v2 swap了" << endl;
	cout << "v1当前各项:" << endl;
	cout << "v1容量" << v1.capacity() + 2 << endl;
	for (i = 0; i < v1.size(); i++)
	{
		cout << " " << v1[i];
	}
	cout << endl;
	v1.push_back(3);
	cout << "从v1后边加入了元素3" << endl;
	cout << "v1容量" << v1.capacity() - 2 << endl;
	for (i = 0; i < v1.size(); i++)
	{
		cout << " " << v1[i];
	}
	cout << endl;
	v1.erase(v1.end() - 2);
	cout << "删除了倒数第二个元素" << endl;
	cout << "v1容量" << v1.capacity() - 2 << endl;
	cout << "v1当前各项:" << endl;
	for (i = 0; i < v1.size(); i++)
	{
		cout << " " << v1[i];
	}
	cout << endl;
	v1.pop_back();
	cout << "v1通过栈操作pop_back放走了最后的元素" << endl;
	cout << "v1当前各项:" << endl;
	cout << "v1容量" << v1.capacity() - 2 << endl;
	for (i = 0; i < v1.size(); i++)
	{
		cout << " " << v1[i];
	}
	cout << endl;
	return 0;
}