539. Minimum Time Difference
Posted andywu
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:
- 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.
题目含义:给定一定24格式的Hour:Minutes字符,找到任意两个时间点的最小时间差
1 public int findMinDifference(List<String> timePoints) { 2 boolean[] minutes = new boolean[24 * 60]; 3 for (String time : timePoints) { 4 String[] values = time.split(":"); 5 int minute = Integer.valueOf(values[0]) * 60 + Integer.valueOf(values[1]); 6 if (minutes[minute]) return 0; 7 minutes[minute] = true; 8 } 9 int min = Integer.MAX_VALUE, left = Integer.MAX_VALUE, right = Integer.MIN_VALUE; 10 int previous = 0;//上一个时间值 11 for (int i = 0; i < minutes.length; i++) { 12 if (!minutes[i]) continue; 13 if (left != Integer.MAX_VALUE) { 14 min = Math.min(min, i - previous);//min记录了最小的时间差 15 } 16 left = Math.min(left, i);//具体零点最近的点 17 right = Math.max(right, i);//距离零点最远的点 18 previous = i; 19 } 20 return Math.min(min, 24 * 60 - right + left); 21 }
以上是关于539. Minimum Time Difference的主要内容,如果未能解决你的问题,请参考以下文章
leetcode--539. Minimum Time Difference
539. Minimum Time Difference 最小时差
539 Minimum Time Difference 最小时间差