首页 > 代码库 > leetcode-539-Minimum Time Difference
leetcode-539-Minimum Time Difference
leetcode-539-Minimum Time Difference
539. Minimum Time Difference
DescriptionSubmissionsSolutions
- Total Accepted: 3164
- Total Submissions: 7087
- Difficulty: Medium
- Contributors: fallcreek
Given a list of 24-hour clock time points in "Hour:Minutes" format, find the minimum minutes difference between any two time points in the list.
Example 1:
Input: ["23:59","00:00"] Output: 1
Note:
- The number of time points in the given list is at least 2 and won‘t exceed 20000.
- The input time is legal and ranges from 00:00 to 23:59.
Subscribe to see which companies asked this question.
题解：
简单的时钟问题； （1）， 先对时间进行排序， （2），计算头尾即可
class Solution {
public:
int GetNum(string tp){
return (60*((tp[0]-‘0‘)*10 + (tp[1]-‘0‘)) + (tp[3]-‘0‘)*10 + tp[4]-‘0‘);
}
int findMinDifference(vector<string>& timePoints) {
int len = timePoints.size();
if(len <= 1){
return 0;
}
sort(timePoints.begin(), timePoints.end());
int tmp, ans = 24*60-GetNum(timePoints[len-1]) + GetNum(timePoints[0]);
for(int i=0; i<len-1; ++i){
tmp = GetNum(timePoints[i+1]) - GetNum(timePoints[i]);
if(tmp < ans){
ans = tmp;
}
}
return ans;
}
};
leetcode-539-Minimum Time Difference
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。