Minimum Time Difference

最新推荐文章于 2021-02-01 14:30:10 发布

小灰灰52309

最新推荐文章于 2021-02-01 14:30:10 发布

阅读量275

点赞数

分类专栏： leetcode ACM 文章标签： Minimum Time Differe

本文链接：https://blog.csdn.net/xiaohuihui52309/article/details/70231852

版权

leetcode 同时被 2 个专栏收录

185 篇文章 0 订阅

订阅专栏

ACM

127 篇文章 0 订阅

订阅专栏

Minimum Time Difference

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.

解析：把所有时间换成分钟表示，对时间排序，求出所有相邻差值中最小值，注意排序后的第一个与最后一个差值，需要把第一个加上一圈的值再相减

代码：

class Solution {
public:
    int findMinDifference(vector<string>& timePoints) {
        vector<int>times;
        for (int i=0; i<timePoints.size(); i++)
        {
            string temp=timePoints[i];
            int hour=0;
            hour=temp[0]-'0';
            hour*=10;
            hour+=temp[1]-'0';
            int minu=0;
            minu=temp[3]-'0';
            minu*=10;
            minu+=temp[4]-'0';
            times.push_back(hour*60+minu);
        }
        
        sort(times.begin(),times.end());
        int N=times.size();
        int ans=INT_MAX;
        for (int i=0; i<N-1; i++)
        {
            ans=min(times[i+1]-times[i],ans);
        }
        ans=min(ans,times[0]+24*60-times[N-1]);
        return ans;
        
    }
};