leetcode每日-2022.01.18-539.最小时间差

最新推荐文章于 2023-03-21 16:45:18 发布

ZzBoAYU

最新推荐文章于 2023-03-21 16:45:18 发布

阅读量100

点赞数

文章标签： leetcode 算法

本文链接：https://blog.csdn.net/qq_39866805/article/details/122555936

版权

给定一个 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"

class Solution {
public:
    int findMinDifference(vector<string>& timePoints) {
        if (timePoints.size() < 2)
            return 0;
        vector<int> time;
        for (int i = 0; i < timePoints.size(); ++i){
            int hour = stoi(timePoints[i].substr(0, 2)) * 60;
            int minute = stoi(timePoints[i].substr(3));
            int sum = hour + minute;
            time.push_back(sum);
            time.push_back(sum + 24 * 60);
        }
        sort(time.begin(), time.end());
        int ans = INT_MAX;
        for (int i = 1; i < time.size(); ++i)
            ans = min(ans, time[i] - time[i-1]);
        return ans;
    }
};