<!--//*<!DOCTYPE html>*//-->
<html lang="en">
<head>
    <meta charset="UTF-8">
    <title>leetcode刷题第536题的解题思路</title>
</head>
<script>
    let findMinDifference = function (timePoints) {
    timePoints = timePoints.sort();
    console.log(timePoints)
        for (let i = 0; i < timePoints.length; i++) {
            let Array1 = timePoints[i].split(":");
            timePoints[i] = parseInt(Array1[0])*60 + parseInt(Array1[1]);

        }
        //console.log("timePoints)


        let min = 1440 - timePoints[timePoints.length-1] + timePoints[0];
        for (let i = 0; i < timePoints.length - 1; i++) {
            if((timePoints[i+1]-timePoints[i])>=720){//大于半圆，最短算另外一边
                if (min>=(1440-timePoints[i+1]+timePoints[i])){
                    min =1440-timePoints[i+1]+timePoints[i];
                }
            }else{//差值在半圆以内，直接减
                    if(min>=timePoints[i+1]-timePoints[i]){
                        min = timePoints[i+1]-timePoints[i];
                    }
            }
        }

        console.log(min)
    }
    findMinDifference(["10:00","23:59","00:00"]);//测试用例
</script>
<body>

</body>

</html>

示意图

LeetCode刷题篇之第539道算法题的解题思路_算法_02

答案：

var findMinDifference = function(timePoints) {
 timePoints = timePoints.sort();
        for (let i = 0; i < timePoints.length; i++) {
            let Array1 = timePoints[i].split(":");
            timePoints[i] = parseInt(Array1[0])*60 + parseInt(Array1[1]);
        }
        let min = 1440 - timePoints[timePoints.length-1] + timePoints[0];
        for (let i = 0; i < timePoints.length - 1; i++) {
            if((timePoints[i+1]-timePoints[i])>=720){
                if (min>=(1440-timePoints[i+1]+timePoints[i])){
                    min =1440-timePoints[i+1]+timePoints[i];
                }
            }else{
                    if(min>=timePoints[i+1]-timePoints[i]){
                        min = timePoints[i+1]-timePoints[i];
                    }
            }
        }
        return min;
};