俩种方法,自己容易忘所以记下来了
一:重载< 比较运算符,最后可以直接用sort()排序
比如:
bool operator < (const Time r)const { return hh * 3600 + mm * 60 + ss < r.hh * 3600 + r.mm * 60 + r.ss; }
比如:
bool cmp(const Time &a,const Time &b)
{
return a.hh * 3600 + a.mm * 60 + a.ss > b.hh * 3600 + b.mm * 60 + b.ss;
}
示例程序:
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
struct Time
{
int hh, mm, ss;
Time(){}
Time(int _hh, int _mm, int _ss) :hh(_hh), mm(_mm), ss(_ss){}
//重载< 这个运算符
bool operator < (const Time r)const { return hh * 3600 + mm * 60 + ss < r.hh * 3600 + r.mm * 60 + r.ss; }
};
//定义一个比较大小的函数
bool cmp(const Time &a,const Time &b)
{
return a.hh * 3600 + a.mm * 60 + a.ss > b.hh * 3600 + b.mm * 60 + b.ss;
}
using namespace std;
int m, n;
int main()
{
//cin >> m >> n;
vector<Time> a;
a.push_back(Time(05, 06, 07));
a.push_back(Time(15, 04, 07));
a.push_back(Time(05, 06, 04));
a.push_back(Time(14, 06, 07));
a.push_back(Time(06, 07, 18));
//用cmp函数 从大到小排
sort(a.begin(), a.end(),cmp);
for (int i = 0; i < a.size(); i++)
{
cout << "hh: "<<a[i].hh<<" mm: "<<a[i].mm<<" ss: "<<a[i].ss<< endl;
}
cout << endl;
//通过重载< 符号,从小到大排
sort(a.begin(), a.end());
for (int i = 0; i < a.size(); i++)
{
cout << "hh: " << a[i].hh << " mm: " << a[i].mm << " ss: " << a[i].ss << endl;
}
return 0;
}
结果图如下: