539. 最小时间差

Author: w2xi

README.md

@@ -103,6 +103,7 @@
 |515|[在每个树行中找最大值](https://leetcode.cn/problems/find-largest-value-in-each-tree-row/)|[JavaScript](./algorithms/find-largest-value-in-each-tree-row.js)|Medium|
 |520|[检测大写字母](https://leetcode.cn/problems/detect-capital/)|[JavaScript](./algorithms/detect-capital.js)|Easy|
 |535|[TinyURL 的加密与解密](https://leetcode.cn/problems/encode-and-decode-tinyurl/)|[JavaScript](./algorithms/encode-and-decode-tinyurl.js)|Medium|
+|539|[最小时间差](https://leetcode.cn/problems/minimum-time-difference/)|[JavaScript](./algorithms/minimum-time-difference.js)|Medium|
 |541|[反转字符串 II](https://leetcode.cn/problems/reverse-string-ii/)|[JavaScript](./algorithms/reverse-string-ii.js)|Easy|
 |543|[二叉树的直径](https://leetcode.cn/problems/diameter-of-binary-tree/)|[JavaScript](./algorithms/diameter-of-binary-tree.js)|Easy|
 |551|[学生出勤记录 I](https://leetcode.cn/problems/student-attendance-record-i/)|[JavaScript](./algorithms/student-attendance-record-i.js)|Easy|

algorithms/minimum-time-difference.js

@@ -0,0 +1,22 @@
+/**
+ * @param {string[]} timePoints
+ * @return {number}
+ */
+var findMinDifference = function (timePoints) {
+  let min = Number.MAX_VALUE;
+  const arr = [];
+  // 转换为分钟
+  for (let item of timePoints) {
+    const [hour, minute] = item.split(":");
+    arr.push(Number(hour) * 60 + Number(minute));
+  }
+  arr.sort((a, b) => a - b);
+
+  for (let i = 1; i < arr.length; i++) {
+    min = Math.min(min, arr[i] - arr[i - 1]);
+  }
+  // 首尾再比较一次
+  min = Math.min(min, 24 * 60 - arr[arr.length - 1] + arr[0]);
+
+  return min;
+};