#include<iostream>
#include<vector>
#include<list>
#include<deque>
using namespace std;
class Dog
{
//成员省略
//必须有>,>=,<,<=,!=关系运算符重载
};
int main()
{
vector<int> ivec1;
vector<int> ivec2;
vector<int> ivec3;
vector<int> ivec4;
vector<int> ivec5;
//比较必须是同类型的比较
vector<double> ivec6;//不可以和int类型的比较
list<int> ilst;
deque<int> ique;
list<string> slst1;
list<string> slst2;//也可以比较
vector<Dog> dogA;
vector<Dog> dogB;//自己做的类型,必须把关系运算符重载,做出来
if (dogA > dogB)//容器的比较实际上比较容器里的数据
{
}
//基本类型的比较ok
for (int i = 0; i != 6; ++i)//向量1
{
ivec1.push_back(i*2+1);
cout << ivec1[i] << endl;
}
for (int i = 0; i != 6; ++i)//向量2
{
ivec2.push_back(i * 2);
cout << ivec2[i] << endl;
}
if (ivec1 > ivec2)
cout << "ivec1大" << endl;//从第一个开始比较
if (ivec1 == ivec2)
cout << "equal" << endl;
else
cout << "error"<<endl;
for (int i = 0; i != 6; ++i)//向量2
{
ivec5.push_back(i * 2 + 1);
cout << ivec5[i] << endl;
}
ivec3.push_back(1);
ivec3.push_back(3);
ivec3.push_back(9);
ivec4.push_back(1);
ivec4.push_back(3);
ivec4.push_back(5);
ivec4.push_back(7);
system("pause");
return 0;
}
顺序容器3
猜你喜欢
转载自blog.csdn.net/weixin_42655231/article/details/82709509
今日推荐
周排行