题目(中等)
给定一个 24 小时制(小时:分钟 “HH:MM”)的时间列表,找出列表中任意两个时间的最小时间差并以分钟数表示。
示例 1:
输入:timePoints = [“23:59”,“00:00”]
输出:1
示例 2:
输入:timePoints = [“00:00”,“23:59”,“00:00”]
输出:0
提示:
2 <= timePoints.length <= 2 * 104
timePoints[i] 格式为 “HH:MM”
解题思路
换成0时刻开始的分钟,排序后比较相邻,注意首尾,设ans初始值为首尾时间差
代码
class Solution {
public:
int findMinDifference(vector<string>& timePoints) {
int n = timePoints.size();
vector<int> time;
for(auto s : timePoints) {
int h = (s[0]-'0') * 10 + s[1]-'0';
int m = (s[3]-'0') * 10 + s[4]-'0';
time.push_back(h*60 + m);
}
sort(time.begin(), time.end());
int ans = 24 * 60 - time.back() + time[0];
for(int i = 1; i < n; i++) {
ans = min(ans, time[i] - time[i-1]);
}
return ans;
}
};