vector容器
vector
容器vector的底层数据结构是数组,连续内存,支持[ ]操作符(支持随机存取)。只支持尾部操作(一端插入删除),所以不能作为队列(queue 一端插入,另一端删除)的底层数据结构。
一个简单的例子
#include<iostream>
#include<vector>
using namespace std;
int main() {
vector<int> v;//容器v
vector<int>::iterator it;//读写迭代器it
//vector<int>::const_iterator it;只读迭代器it
//写容器同时配一个迭代器
int i;
for (i = 0; i <= 6;i++) {
v.push_back(i);//在尾部插入
}
//迭代器相当于指针,v.begin()为容器v的开始元素,v.end()为容器的结束标志,类似于NULL,是容器最后一个元素的下一个位置
for (it = v.begin(); it!= v.end();it++) {
cout << *it << " ";//通过读写迭代器读容器t的元素
*it += 1;//通过读写迭代器写容器t的元素
}
cout << endl;
//cout << v.front() << endl;//1
//cout << v.back() << endl;//7
//it = v.begin();
//cout << *it<<endl;//1
//v.clear();
//v.pop_back();
//使用[ ]操作符迭代
for (i = 0; i < v.size();i++) {
cout << v[i] << " ";
}
cout << endl;
}
注意
- 若要定义多个容器和迭代器,则不方便;
简写:
typedef vector<int> IC;
typedef vector<int>::iterator IT;
IC v;
IT it;
- 迭代器相当于指针,v.begin()为容器v的开始元素的位置,v.end()为容器的结束标志,类似于NULL,是容器最后一个元素的下一个位置。读写操作/只读操作。
- v.push_back() 在末尾插入元素
- v.front() 表示第一个元素
- v.back() 表示最后一个元素
- v.pop_back() 删除末尾元素
- v.size() 容器v的元素个数
- v.clear() 清除容器v中的元素
- IC IT相当于类,v it 相当于对象,我们所有的实现都是基于面向对象。
排序,查找,删除
排序sort(v.begin(),v.end(),比较函数)
注意
- 用到生成随机数。
这里要用到的是srand()函数(生成种子)**time()**函数,**rand()**函数(生成随机数) 。需要说明的是,iostream头文件中就有srand函数的定义,不需要再额外引入stdlib.h;而使用time()函数需要引入ctime头文件
.(我自己是没有写ctime头文件的,也可以用) - sort()算法包含在头文件#include <algorithm>中;
- 第一次迭代输出的是随机数,第二次迭代输出的是已经排序好的数。
- 中间加了代码sort(v.begin(),v.end());默认从小到大
- 定义一个比较函数,来控制比较是从大到小还是从小到大。
代码
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef vector<int> IC;
typedef vector<int>::iterator IT;
int main() {
IC v;
IT it;
srand(time(0));//种子
int i;
for (i = 0; i <= 6;i++) {
v.push_back(rand()%100);//随机生成100以内
}
//迭代器相当于指针,v.begin()为容器v的开始元素,v.end()为容器的结束标志
for (it = v.begin(); it!= v.end();it++) {
cout << *it << " ";
}
cout << endl;
sort(v.begin(),v.end());
//使用[ ]操作符迭代
for (i = 0; i < v.size();i++) {
cout << v[i] << " ";//clear() front() back() pop_back() erase()
}
cout << endl;
}
定义比较函数后:
调用:比较函数作为第三个参数;
sort(v.begin(),v.end(),comp);
从小到大
bool comp(int v1,int v2) {
if (v1<v2) {
return true;
}
return false;
}
从大到小
bool comp(int v1,int v2) {
if (v1>v2) {
return true;
}
return false;
}
插入it=find(v.begin(),v.end(),要找的数)
注意
- 头文件<algorithm>
- 查找的返回是一个迭代型,也就是位置,也就必须赋值给迭代器。然后看位置是否在结束标志(最后一个元素的下一个位置)表示没找到。
- 用随机数生成,所以我们不能确定所要找的在不在容器v中,我们在随机生成树后插入一个数13,v.bush_back(13);
代码
v.push_back(13);
for (it = v.begin(); it!= v.end();it++) {
cout << *it << " ";
}
cout << endl;
it = find(v.begin(),v.end(),13);
if (it != v.end()) {
cout << "find" << endl;
}
else cout << "not find" << endl;
大概率找不到:现在我们找14:
it = find(v.begin(),v.end(),14);
if (it != v.end()) {
cout << "find" << endl;
}
else cout << "not find" << endl;
删除it=erase(it)
注意
- 参数是位置,也就是要用迭代器
- 当erase(it)找到it指向的元素后,在erase()内部it自动++,外层循环又++,会出错。所以在删除语句后要it–。
- 删除时需要保存下it;
代码
for (i = 0; i <= 6;i++) {
v.push_back(i);
}
for (it = v.begin(); it!= v.end();it++) {
cout << *it << " ";
if (*it==1) {
it=v.erase(it);//it自动++
it--;
}
}
cout << endl;
for (i = 0; i < v.size();i++) {
cout << v[i] << " ";
}
cout << endl;
用while循环:
it = v.begin();
while (it!=v.end()) {
cout << *it << " ";
if (*it == 1)
it=v.erase(it);//自动++,下面必须要else关键字
else
it++;
}
cout << endl;
for (i = 0; i < v.size();i++) {
cout << v[i] << " ";
}
cout << endl;
Vector对非内建型别的操作:结构体和对象
vector<结构体>
容器里放结构体变量。
代码
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef struct _PersonInfo{
char name[20];
int age;
float height;
char sex;
}PersonInfo,*PPersonInfo;
typedef vector<PersonInfo> PIC;
typedef vector<PersonInfo>::iterator PIt;
//如何把一个结构体数据插入到容器中
void vectordemo1(){
PIC picVec;
PIt pit;
//插入
PersonInfo pi1 = {"tom",22,1.78f,'M'};
picVec.push_back(pi1);
PersonInfo pi2 = { "lily",23,1.68f,'F' };
picVec.push_back(pi2);
PersonInfo pi3 = { "lucy",24,1.55f,'F' };
picVec.push_back(pi3);
PersonInfo pi4 = { "david",20,1.88f,'M' };
picVec.push_back(pi4);
PersonInfo pi5 = { "jason",25,1.78f,'M' };
picVec.push_back(pi5);
//遍历
for (pit = picVec.begin(); pit!=picVec.end();pit++) {
cout << pit->name <<" "<< pit->age << " " << pit->height << " " << pit->sex << " " << endl;
}
//删除
for (pit = picVec.begin(); pit != picVec.end(); pit++) {
if (strcmp(pit->name,"lucy")==0) {
pit = picVec.erase(pit);
pit--;
}
}
//遍历
for (pit = picVec.begin(); pit != picVec.end(); pit++) {
cout << pit->name << " " << pit->age << " " << pit->height << " " << pit->sex << " " << endl;
//cout <<(*pit).name << " " << (*pit).age << " " << (*pit).height << " " << (*pit).sex << " " << endl;
}
//打印出第一个元素
PersonInfo ps = picVec.front();//ps为实例对象,用.
cout << ps.name << " " << ps.age << " " << ps.height << " " <<ps.sex << " " << endl;
//打印出末尾元素
PersonInfo back = picVec.back();//back为实例对象,用.
cout << back.name << " " << back.age << " " << back.height << " " << back.sex << " " << endl;
//删除末尾元素
picVec.pop_back();
//遍历
for (pit = picVec.begin(); pit != picVec.end(); pit++) {
cout << pit->name << " " << pit->age << " " << pit->height << " " << pit->sex << " " << endl;
}
}
int main() {
vectordemo1();
}
注意
- cout << pit->name << " " << pit->age << " " << pit->height << " " << pit->sex << " " << endl;
或者
cout <<(*pit).name << " " << (*pit).age << " " << (*pit).height << " " << (*pit).sex << " " << endl; - if (strcmp(pit->name,“lucy”)==0)
vector<类名>
容器里放类的对象。
代码
Student类
class Student {
public:
int m_age;
char* m_name;
//构造函数
Student(int age,const char *name) {
m_age = age;
m_name = (char*)malloc(strlen(name)+1);
strcpy_s(m_name, strlen(name) + 1,name);
}
//拷贝构造函数
Student(const Student& stu) {//防止在对象拷贝过程中,m_name指针引起的拷贝问题
m_age = stu.m_age;
m_name = (char*)malloc(strlen(stu.m_name) + 1);
strcpy_s(m_name, strlen(stu.m_name) + 1, stu.m_name);
}
//析构函数
~Student() {
free(m_name);
}
//==操作符重载,find()要用到
bool operator ==(const Student &stu)const {
//只有年龄和姓名相同才是相等的
if ((strcmp(m_name,stu.m_name)==0)&&(m_age==stu.m_age)) {
return true;
}
return false;
}
//>运算符重载
bool operator >(const Student& stu)const {
//只有年龄和姓名相同才是相等的
if (m_age>stu.m_age) {
return true;
}
return false;
}
//<运算符重载
bool operator <(const Student& stu)const {
//只有年龄和姓名相同才是相等的
if (m_age < stu.m_age) {
return true;
}
return false;
}
//=赋值运算符重载
Student& operator =(const Student &stu) {
if (*m_name != '/0')
delete[] m_name;
m_name = (char*)malloc(strlen(stu.m_name)+1);
strcpy_s(m_name,strlen(stu.m_name)+1,stu.m_name);
m_age = stu.m_age;
return *this;
}
};
容器代码
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;
typedef vector<Student> SIC;
typedef vector<Student>::iterator SIT;
//小到大
bool Mycomp1(const Student s1,const Student s2) {
return s1.m_age < s2.m_age;
}
//大到小
bool Mycomp2(const Student s1, const Student s2) {
return s1.m_age > s2.m_age;
}
void vectordemo() {
SIC sic;
SIT sit;
//插入
Student stu1(20, "lily");
sic.push_back(stu1);
Student stu2(25, "lucy");
sic.push_back(stu2);
Student stu3(35, "jim");
sic.push_back(stu3);
Student stu4(22, "david");
sic.push_back(stu4);
Student stu5(18, "susan");
sic.push_back(stu5);
//遍历
for (sit = sic.begin(); sit != sic.end();sit++) {
cout << sit->m_name << " " << sit->m_age << endl;
}
cout << endl;
//删除
for (sit = sic.begin(); sit != sic.end(); sit++) {
if (strcmp(sit->m_name,"lucy")==0) {
sit = sic.erase(sit);
sit--;
}
}
//删除后遍历
for (sit = sic.begin(); sit != sic.end(); sit++) {
cout << sit->m_name << " " << sit->m_age << endl;
}
cout << endl;
//查找1依赖bool operator ==(Student &stu)
sit = find(sic.begin(),sic.end(),Student(22, "david"));
if (sit != sic.end()) {
cout << "found david" << endl;
}
else cout << "not found david" << endl;
//查找2依赖bool operator ==(Student &stu)
sit = find(sic.begin(), sic.end(), Student(22, "lucy"));
if (sit != sic.end()) {
cout << "found lucy" << endl;
}
else cout << "not found lucy" << endl;
cout << endl;
//排序
sort(sic.begin(),sic.end());//默认从小到大
//排序后遍历
for (sit = sic.begin(); sit != sic.end(); sit++) {
cout << sit->m_name << " " << sit->m_age << endl;
}
cout << endl;
//从小到大排序
sort(sic.begin(), sic.end(),Mycomp1);
//排序后遍历
for (sit = sic.begin(); sit != sic.end(); sit++) {
cout << sit->m_name << " " << sit->m_age << endl;
}
cout << endl;
//从大到小排序
sort(sic.begin(), sic.end(), Mycomp2);
//排序后遍历
for (sit = sic.begin(); sit != sic.end(); sit++) {
cout << sit->m_name << " " << sit->m_age << endl;
}
cout << endl;
//依赖bool operator <(Student& stu)从小到大
sort(sic.begin(), sic.end(),less<Student>());//默认从小到大
//排序后遍历
for (sit = sic.begin(); sit != sic.end(); sit++) {
cout << sit->m_name << " " << sit->m_age << endl;
}
cout << endl;
//依赖bool operator >(Student& stu)从大到小
sort(sic.begin(), sic.end(), greater<Student>());//默认从大到小
//排序后遍历
for (sit = sic.begin(); sit != sic.end(); sit++) {
cout << sit->m_name << " " << sit->m_age << endl;
}
}
int main() {
vectordemo();
}
注意
- char * 类型的形参前要加const;
- 关于char* 类型的数据成员
m_name = (char*)malloc(strlen(name)+1);
strcpy_s(m_name, strlen(name) + 1,name); - 查找find()中用到了等号运算符==
- 排序sort()从小到大用到了重载的<运算符(less)
- 排序sort()从大到小用到了重载的>运算符(greater)
- less greater 用到#include<functional>头文件
- 排序从小到大,从大到小也可以用比较函数实现
- Student(int age,const char *name)
Student(const Student& stu)
~Student()
bool operator ==(const Student &stu)const
bool operator >(const Student& stu)const
bool operator <(const Student& stu)const
Student& operator =(const Student &stu)