539. 最小时间差

(https://leetcode-cn.com/problems/minimum-time-difference/)

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

思路

先统一转成分钟，再相减

源码

function findMinDifference(timePoints: string[]): number {
    const len = timePoints.length;
    let minutes = new Array();
    for (let i = 0; i < len; i++) {
        minutes.push(parseInt(timePoints[i].slice(0, 2)) * 60 + parseInt(timePoints[i].slice(3, 5)));
    }
    minutes = minutes.sort((a, b) => a - b);
    const length = minutes.length;
    let min = minutes[1] - minutes[0];
    for (let i = 1; i < length; i++) {
        //任意两时刻相差最多不超过12小时
        let time = minutes[i] - minutes[i - 1] > 720 ? 1440 - (minutes[i] - minutes[i - 1]) : minutes[i] - minutes[i - 1];
        min = time < min ? time : min;
    }
    let time = minutes[length - 1] - minutes[0] > 720 ? 1440 - (minutes[length - 1] - minutes[0]) : minutes[length - 1] - minutes[0];
    return min < time ? min : time
};

结果

image-20220118163524538