Minimum Time Difference LeetCode solution in Java

1
class Solution {
2
  public int findMinDifference(List<String> timePoints) {
3
    int N = timePoints.size();
4
    int[] minutes = new int[N];
5
    for (int i = 0; i < N; i++) {
6
      int hr = Integer.parseInt(timePoints.get(i).substring(0, 2));
7
      int min = Integer.parseInt(timePoints.get(i).substring(3, 5));
8
      minutes[i] = hr * 60 + min;
9
    }
10
    Arrays.sort(minutes);
11
    int res = Integer.MAX_VALUE;
12
    for (int i = 0; i < N - 1; i++) {
13
      res = Math.min(res, minutes[i + 1] - minutes[i]);
14
    }
15
    int b = minutes[0];
16
    int a = minutes[N - 1];
17
    return Math.min(res, (b - a + 1440) % 1440);
18
  }
19
}