题目描述
给定一个 24 小时制(小时:分钟 “HH:MM”)的时间列表,找出列表中任意两个时间的最小时间差并以分钟数表示。
示例 1:
输入:timePoints = ["23:59","00:00"]
输出:1
示例 2:
输入:timePoints = ["00:00","23:59","00:00"]
输出:0
提示:
2 <= timePoints <= 2 * 104
timePoints[i] 格式为 "HH:MM"
思路
对时间排个序,然后挨个求间隔就行啦
处理格式可以用
sccanf()
题解
class Solution {
public:
int findMinDifference(vector<string>& timePoints) {
int res=INT_MAX;
vector<int> times;
for(auto time:timePoints){
int h,m;
sscanf(time.c_str(),"%d:%d",&h,&m);
times.push_back(60*h+m);
}
sort(times.begin(),times.end());
for(int i=0;i<times.size()-1;i++) res=min(res,times[i+1]-times[i]);
res=min(res,24*60-times.back()+times[0]);
return res;
}
};