vector
这个比较重要,不过也很简单
一、介绍
vector就是高级数组。
二、使用步骤
1.引入头文件
#include<vector>
2.各种函数操作
1.初始化
创建一个int数组。
vector<int>v;//创建一个空数组
vector <int>v3(3, 100);//把三个100塞进去
vector<int>v2(8);//创建长度为8的空数组
2.增
v.push_back(2);
v.insert(v.begin(), 288);
v.insert(v.begin(),2,188);//插入2个188
3.删
v.erase(v.begin());//删除
v.erase(v.begin(),v.end());//区间删除
v.clear();//清空
4.改
5.查
6.遍历
1.指针式遍历
把v.begin()理解成v[0],v.end()就是v数组最后一个。
vector::iterator it = v.begin() 意思是:vector类型的指针(it指针)指向v的第一个数。
for (vector<int>::iterator it = v.begin(); it != v.end(); it++) {
cout<<*it<<endl;
}
2.函数式遍历
需要使用到头文件#include
自行理解
void print(int a) {
cout << a << endl;
}
for_each(v.begin(), v.end(),print);
7.嵌套
vector<vector<int>>v;//相当于二维int数组
8.拷贝
vector<int>v2=v;//直接赋值
vector <int>v2(v.begin(), v.end());//区间拷贝
9.其它
v.empty();//如果是空,返回true
v.resize(100,1000);//重新指定长度
v.swap(v1);//交换容器
总结
这里是代码,供大家测试;
/*#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
void print(int a) {
cout << a << endl;
}
void text() {
vector<int>v;
v.push_back(10);
v.push_back(20);
v.push_back(30);
//1
///*for (vector<int>::iterator it = v.begin(); it != v.end(); it++) {
// cout<<*it<<endl;
//}
//2.
for_each(v.begin(), v.end(),print);//print 是自定义函数
}
int main() {
text();
}*/
//容器嵌套
/*#include<iostream>
#include<vector>
using namespace std;
void text() {
vector<vector<int>>v;
vector<int>v1;
vector<int>v2;
vector<int>v3;
vector<int>v4;
for (int i = 2; i < 6; i++) {
v1.push_back(i);
v2.push_back(i+10);
v3.push_back(i+20);
v4.push_back(i+30);
}
v.push_back(v1);
v.push_back(v2);
v.push_back(v3);
v.push_back(v4);
for (vector<vector<int>>::iterator it = v.begin(); it != v.end(); it++) {
for (vector<int>::iterator vt = (*it).begin(); vt!=(*it).end(); vt ++) {
cout << *vt << " ";
}
cout << endl;
}
}
int main() {
text();
}*/
//构造函数
/*#include<iostream>
#include<vector>
using namespace std;
void prints(vector<int>& v) {
for (vector<int>::iterator it = v.begin(); it != v.end(); it++)
cout << *it<<" ";
cout << endl;
}
int main() {
vector <int>v;//模板 无参构造
for (int i = 0; i <10; i++)
v.push_back(i);
vector <int>v2(v.begin(), v.end());//区间拷贝
prints(v2);
vector <int>v3(3, 100);//把三个100塞进去
prints(v3);
}*/
//拷贝函数
/*#include<iostream>
#include<vector>
using namespace std;
int main() {
vector<int>v;
v.push_back(20);
vector<int>v1(v);
v1 = v;
v1.assign(v.begin(), v.end());
v1.assign(10, 100);//塞进去10个100
for (vector<int>::iterator it=v1.begin(); it != v1.end(); it++)
cout << *it;
}*/
//容量和大小
/*#include<iostream>
#include<vector>
using namespace std;
int main() {
vector<int>v;
int i = 10;
while (i--)
v.push_back(i);
for (vector<int>::iterator it = v.begin(); it != v.end(); it++)
cout << *it << " ";
cout << endl;
if (v.empty())
cout << "v是空" << endl;
else {
cout << "v不为空" << endl;
cout << "容量是:" << v.capacity() << endl;//容器容量 要大于size,避免每次增加数据时要重新分配内存
cout << "大小是:" << v.size();//元素个数
}
cout << endl;
//resize() 重新指定长度
v.resize(16,1000);//超出容量默认赋值0,或者赋值自定义的数字
for (vector<int>::iterator it = v.begin(); it != v.end(); it++)
cout << *it << " ";
cout << endl;
v.resize(4);//未超出容量,其余部分永久性删除
for (vector<int>::iterator it = v.begin(); it != v.end(); it++)
cout << *it << " ";
return 0;
}*/
//插入与删除
/*#include<iostream>
#include<vector>
using namespace std;
void pri(vector<int>&v) {
for (vector<int>::iterator it = v.begin(); it != v.end(); it++)
cout << *it << " ";
cout << endl;
}
int main() {
vector<int>v;
int i = 10;
while (i--)
v.push_back(i);
v.pop_back();
pri(v);
//v.begin()迭代器
v.insert(v.begin(), 288);
v.insert(v.begin(),2,188);//插入2个188
v.erase(v.begin());//删除
v.erase(v.begin(),v.end());//清空
v.clear();
return 0;
}*/
//数据存取 直接看成数组
//交换容器 resize 不会改变容量
/*#include<iostream>
#include<vector>
using namespace std;
void pri(vector<int>& v) {
for (vector<int>::iterator it = v.begin(); it != v.end(); it++)
cout << *it << " ";
cout << endl;
}
int main() {
vector<int>v;
int i = 20;
while (i--)
v.push_back(i);
pri(v);
vector<int>v1;
i = -19;
while (i++)
v1.push_back(i);
pri(v1);
v.swap(v1);
pri(v);
pri(v1);
cout << v.capacity()<<endl;
cout << v1.capacity()<<endl;
vector<int>(v).swap(v1);//收缩容量 匿名对象(内存系统自动释放)
cout << v.capacity()<<endl;
cout << v1.capacity()<<endl;
return 0;
}*/