539. Minimum Time Difference 最小时差

Posted Long Long Journey

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了539. 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:

  1. The number of time points in the given list is at least 2 and won‘t exceed 20000.

  2. The input time is legal and ranges from 00:00 to 23:59.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
class Solution:
    def findMinDifference(self, timePoints):
        """
        :type timePoints: List[str]
        :rtype: int
        """
        def convert(time):
            return int(time[:2]) * 60 + int(time[3:])
 
        minutes = [convert(i) for i in timePoints]
        minutes.sort()
 
        z = zip(minutes, minutes[1:] + minutes[:1])
        return min([(y - x) % (24 * 60) for x, y in z])
 
 
s = Solution()
timePoints = ["23:00", "00:00", "12:00", "23:30", "12:15"]
res = s.findMinDifference(timePoints)
print(res)










以上是关于539. Minimum Time Difference 最小时差的主要内容,如果未能解决你的问题,请参考以下文章

leetcode--539. Minimum Time Difference

539. Minimum Time Difference 最小时差

539. Minimum Time Difference

539 Minimum Time Difference 最小时间差

Python解Leetcode: 539. Minimum Time Difference

LeetCode 2187. Minimum Time to Complete Trips