一维向量vector几乎所有用法

//:vector的使用练习
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
	vector<int> vec1(10,4);
	int size1 = vec1.size();										//确定vec1的大小
	cout << " vec1.capacity()= " << vec1.capacity() << endl;		//确定vec1的容量	
	cout << " size1= " << size1 << endl;
	vec1[4] = 333 + vec1[3];										//赋值
	cout << " vec1[4]= " << vec1[4] << endl;
	cout << " vec1.capacity()= " << vec1.capacity() << endl;
	vec1.insert(vec1.begin() + 4, 43);								//插入单个或区间元素
	cout << " vec1.capacity()= " << vec1.capacity() << endl;
	cout << " vec1[0]= " << vec1[0] << '\n' << " vec1[10]= " << vec1[10] << endl;
	cout << " vec1[4]= " << vec1[4] << '\n' << " vec1[5]= " << vec1[5] << endl;
	cout << " size1= " << size1 << endl;
	int size11 = vec1.size();
	cout << " size11= " << size11 << endl;
	int bo1 = vec1.empty();											//判断向量大小是否为空
	cout << " bo1= " << bo1 << endl;
	vec1.erase(vec1.begin() + 4);									//删除某位置上的元素，但不改变容量
	cout << " vec1.erase(vec1.begin()+4) " << " vec1[4]= " << vec1[4] << endl;
	cout << " vec1.size()= " << vec1.size() << "---" << endl;
	vec1.resize(13);												//重新定义向量大小
	cout << " vec1.capacity()= " << vec1.capacity() << endl;
	int size111 = vec1.size();
	cout << " size111= " << size111 << endl;
	cout << " vec1[12]= " << vec1[12] << endl;
	cout << "-------" << endl;
	vector<int>::iterator it = vec1.begin();						//向量的迭代器-即指针
	for (int i = 0;it != vec1.end();it++, i++) {					//begin（），end（）也是向量的迭代器
		cout << " vec1[" << i << "]= " << *it << endl;				//遍历向量元素
	}
	*(it - 1) = 111;
	cout << vec1[9] << endl;
	cout << (vec1.end() - vec1.begin()) << endl;
	cout << '\n' << "=======================" << endl;


	vector<int> vec2(vec1);											//套用另一向量初始化
	int size2 = vec2.size();
	cout << " size2= " << size2 << endl;
	vec2.erase(vec2.begin(), vec2.end() - 1);						//删除区间内的元素
	vec2.pop_back();												//删除末尾元素
	vec2.push_back(2333);											//在末尾插入元素
	vector<int>::iterator it2 = vec2.begin();						//迭代器
	for (int i = 0;it2 != vec2.end();it2++, i++) {					//遍历
		cout << " vec2[" << i << "]= " << *it2 << endl;
	}
	cout << '\n' << "=====================" << endl;


	vector<int> vec3(vec1.begin(), vec1.begin() + 5);				//套用另一向量区间初始化
	int size3 = vec3.size();							
	cout << " size3= " << size3 << endl;
	swap(vec1, vec3);												//交换两个向量
	cout << " swap size3= " << vec3.size() << endl;
	vec3.clear();													//清空向量大小,但不回收容量
	int size33 = vec3.size();
	cout << " size33= " << size33 << endl;
	cout << " vec3.capacity()= "<<vec3.capacity() << endl;
	cout << '\n' << "======================" << endl;


	vector<int> vec4(1);
	cout << " vec4[0]= " << vec4[0] << endl;
	vec4.push_back(33);
	cout << " vec4[1]= " << vec4[1] << endl;
	cout << " vec4.capacity()= " << vec4.capacity() << endl;
	int bo4 = vec4.empty();											//判断向量大小是否为空，返回0或1
	cout << " bo4= " << bo4 << endl;
	cout << " size4= " << vec4.size() << endl;
	cout << " vec4.capacity()= " << vec4.capacity() << endl;
	vector <int>().swap(vec4);										//清空向量元素并最小化容量
	cout << " size4= " << vec4.size() << endl;
	cout << " vec4.capacity()= " << vec4.capacity() << endl;
	cout << '\n' << "=====================" << endl;

	vector<int> vec5 = { 6,5,4,88,54,21,54,68,77,23,10,5,89,3,2,1 };
	sort(vec5.begin(), vec5.end());									//正向排序，包含<algorithm>算法头文件
	for (int i = 0;i < vec5.size();i++) {
		cout << " vec5[" << i << "]= " << vec5[i] << endl;
	}
	cout << '\n';;
	reverse(vec5.begin(), vec5.end());								//逆转向量中的所有元素
	for (int i = 0;i < vec5.size();i++) {
		cout << " vec5[" << i << "]= " << vec5[i] << endl;
	}
	cout << '\n';
	sort(vec5.rbegin(), vec5.rend());								//反向迭代器
	for (int i = 0;i < vec5.size();i++) {
		cout << " vec5[" << i << "]= " << vec5[i] << endl;
	}
	cout << '\n' << "=====================" << endl;

	vector<int> vec6 = {1,2,2,2,3,3,3,5,5,5,9,9,9,8,8,8,8,7,7,7};
	cout << " size6= " << vec6.size() << endl;
	int newint= unique(vec6.begin(), vec6.end()-1) - vec6.begin();	//把相邻的重复元素“删去”--放到最前边，向量大小不变。包含<algorithm>算法头文件
	for (int i = 0;i < vec6.size();i++) {
		cout << " vec6[" << i << "]= " << vec6[i] << endl;
	}
	cout << '\n';
	for (int i = 0;i < newint;i++) {
		cout << " vec6[" << i << "]= " << vec6[i] << endl;
	}
}

对于二位向量

#include<vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
	vector<vector<int>> vec1(2);
	vec1[0] = { 1,2,3,4,5 };
	vec1[1] = { 2 };
	for (int i = 0;i < 2;i++) {
		for (int j = 0;j < vec1[i].size();j++) {
			cout << " vct1[" << i << "][" << j << "]= " << vec1[i][j] << endl;
		}
	}
}

动态管理内存，每个向量的大小不一