1. 程式人生 > >539. Minimum Time Difference

539. Minimum Time Difference

++ 兩個 for points minutes iou epo nts cnblogs

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.

題目含義:給定一定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