[LeetCode Sync] Runtime - 8 ms (71.83%), Memory - 20.4 MB (55.18%)

Author: NinePiece2

Solutions/0539-minimum-time-difference/README.md

@@ -0,0 +1,16 @@
+Given a list of 24-hour clock time points in <strong>&quot;HH:MM&quot;</strong> format, return <em>the minimum <b>minutes</b> difference between any two time-points in the list</em>.
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+<pre><strong>Input:</strong> timePoints = ["23:59","00:00"]
+<strong>Output:</strong> 1
+</pre><p><strong class="example">Example 2:</strong></p>
+<pre><strong>Input:</strong> timePoints = ["00:00","23:59","00:00"]
+<strong>Output:</strong> 0
+</pre>
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>2 &lt;= timePoints.length &lt;= 2 * 10<sup>4</sup></code></li>
+	<li><code>timePoints[i]</code> is in the format <strong>&quot;HH:MM&quot;</strong>.</li>
+</ul>

Solutions/0539-minimum-time-difference/solution.py

@@ -0,0 +1,6 @@
+class Solution:
+    def findMinDifference(self, timePoints: List[str]) -> int:
+        sorted_timePoints = sorted(int(val[:2]) * 60 + int(val[3:]) for val in timePoints)
+        sorted_timePoints.append(sorted_timePoints[0] + 1440)
+
+        return min(val2 - val1 for val1, val2 in pairwise(sorted_timePoints))