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

最新推荐文章于 2024-02-16 14:39:25 发布

听说你很会玩

最新推荐文章于 2024-02-16 14:39:25 发布

阅读量654

点赞数

分类专栏： LeetCode刷题文章标签： leetcode 算法 javascript 数据结构经验分享

听说你很会玩

本文链接：https://blog.csdn.net/qq_44224698/article/details/122572470

版权

LeetCode刷题专栏收录该内容

12 篇文章 1 订阅

订阅专栏

leetcode刷题系列：

原创 LeetCode刷题篇之第1道算法题的解题思路
 原创LeetCode刷题篇之第43道算法题的解题思路
 原创 LeetCode刷题篇之第58道算法题的解题思路
 原创 LeetCode刷题篇之第67道算法题的解题思路
 原创LeetCode刷题篇之第164道算法题的解题思路
 原创 LeetCode刷题篇之第189道算法题的解题思路
 原创 LeetCode刷题篇之第268道算法题的解题思路
 原创 LeetCode刷题篇之第557道算法题的解题思路

题目：
在这里插入图片描述
解题思路：

<!--//*<!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>

示意图
在这里插入图片描述
答案：

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;
};