给定一个 24 小时制(小时:分钟 "HH:MM")的时间列表,找出列表中任意两个时间的最小时间差并以分钟数表示。
示例 1:
输入:timePoints = ["23:59","00:00"]
输出:1
示例 2:
输入:timePoints = ["00:00","23:59","00:00"]
输出:0
提示:
2 <= timePoints.length <= 2 * 104
timePoints[i] 格式为 "HH:MM"
方法一:排序
将 \textit{timePoints}timePoints 排序后,最小时间差必然出现在 \textit{timePoints}timePoints 的两个相邻时间,或者 \textit{timePoints}timePoints 的两个首尾时间中。因此排序后遍历一遍 \textit{timePoints}timePoints 即可得到最小时间差。
func getMinutes(t string) int{//返回24小时制时间对应的分钟数
return ((int(t[0] - '0') * 10 + int(t[1] - '0')) * 60 + int(t[3] - '0') * 10 + int(t[4] - '0'))
}
func findMinDifference(timePoints []string) int {
sort.Strings(timePoints)//按字典顺序对字符串进行排序,从小到大排
ans := math.MaxInt32//最大的32位int数
t0Minutes := getMinutes(timePoints[0])
preMinutes := t0Minutes
for _, t := range timePoints[1:]{
minutes := getMinutes(t)
ans = min(ans, minutes - preMinutes)// 相邻时间的时间差
preMinutes = minutes
}
ans = min(ans, t0Minutes+1440-preMinutes)
return ans
}
func min(a, b int) int{
if a > b {
return b
}
return a
}
方法二:鸽巢原理
根据题意,一共有 24 \times 60=144024×60=1440 种不同的时间。由鸽巢原理可知,如果 \textit{timePoints}timePoints 的长度超过 14401440,那么必然会有两个相同的时间,此时可以直接返回 00。
func getMinutes(t string) int {
return (int(t[0]-'0')*10+int(t[1]-'0'))*60 + int(t[3]-'0')*10 + int(t[4]-'0')
}
func findMinDifference(timePoints []string) int {
if len(timePoints) > 1440 {
return 0
}
sort.Strings(timePoints)
ans := math.MaxInt32
t0Minutes := getMinutes(timePoints[0])
preMinutes := t0Minutes
for _, t := range timePoints[1:] {
minutes := getMinutes(t)
ans = min(ans, minutes-preMinutes) // 相邻时间的时间差
preMinutes = minutes
}
ans = min(ans, t0Minutes+1440-preMinutes) // 首尾时间的时间差
return ans
}
func min(a, b int) int {
if a > b {
return b
}
return a
}