539. Minimum Time Difference
来源:互联网 发布:最早的网络竞技游戏 编辑:程序博客网 时间:2024/05/16 14:33
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:
- The number of time points in the given list is at least 2 and won't exceed 20000.
- The input time is legal and ranges from 00:00 to 23:59.
Solution:
我当初的想法是,按照每两个元素进行比较,先进行顺时针比较,再进行逆时针比较。但是,想了半天也没想出所以然来。看了别人的答案,才发现自己考虑太过于复杂
顺时针和逆时针之差相差是24h,即是24*60分钟
class Solution(object): def findMinDifference(self, timePoints): """ :type timePoints: List[str] :rtype: int """ times = sorted(timePoints) times = [int(t[:2]) * 60 + int(t[-2:]) for t in times] result = 1 << 31 n = len(times) for i in xrange(n): if i < n - 1: result = min(result, times[i + 1] - times[i]) else: result = min(result, times[0] - times[i] + 24 * 60) return result
阅读全文
0 0
- 539. Minimum Time Difference
- 539. Minimum Time Difference
- 539. Minimum Time Difference
- 539. Minimum Time Difference
- 539.Minimum Time Difference
- leetcode 539. Minimum Time Difference
- Leetcode-539. Minimum Time Difference
- [leetcode] 539. Minimum Time Difference
- [LeetCode]539. Minimum Time Difference
- LeetCode 539. Minimum Time Difference
- leetcode 539. Minimum Time Difference
- LeetCode 539. Minimum Time Difference
- leetcode 539. Minimum Time Difference
- LeetCode:539. Minimum Time Difference
- leetcode 539. Minimum Time Difference
- LeetCode笔记:539. Minimum Time Difference
- [Leetcode] 539. Minimum Time Difference 解题报告
- Minimum Time Difference
- 基于SSM的CRUD小栗子
- 实验探究 ioremap
- test STL
- leetcode -- 58. Length of Last Word【遍历数组的次序:前后】
- 我的备用书单
- 539. Minimum Time Difference
- uva 10795 A Different Task (汉诺塔升级)
- 一次生日Party可能有p人或者q人参加,现准备有一个大蛋糕.问最少要将蛋糕切成多少块(每块大小不一定相等),才能使p人或者q人出席的任何一种情况,都能平均将蛋糕分食
- Strus2类型转换器心得
- 合并两个排序链表
- JavaScript_2
- js获取一个字符串的某个字符的索引
- 排序算法学习(4)
- linux下c++连接mysql数据库