every blog every motto: You will never know unless you try
0. 前言
生活好难,再坚持坚持!
1. 字符串
1.1 题目
1.2
class Solution:
def findMinDifference(self, timePoints: List[str]) -> int:
# 总长度
if len(timePoints)>1440:
return 0
ms = []
for t in timePoints:
h, m = t.split(':')
ms.append(int(h) * 60 + int(m))
# 排序
ms.sort()
minv = 9999 # 最小值
# 相邻两数比较,求最小值
for i in range(len(ms) - 1):
minv = min(minv, ms[i + 1] - ms[i])
# print(minv)
# 第一个数和最后一个数
minv = min(minv, 24 * 60 - ms[len(ms) - 1] + ms[0])
return minv