首页 > 其他 > 详细

539. Minimum Time Difference 最小时差

时间:2018-02-12 23:24:38      阅读:268      评论:0      收藏:0      [点我收藏+]

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 最小时差

原文:https://www.cnblogs.com/xiejunzhao/p/8445802.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!