mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
17 lines
689 B
HTML
17 lines
689 B
HTML
Given a list of 24-hour clock time points in <strong>"HH:MM"</strong> format, return <em>the minimum <b>minutes</b> difference between any two time-points in the list</em>.
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
<pre><strong>Input:</strong> timePoints = ["23:59","00:00"]
|
|
<strong>Output:</strong> 1
|
|
</pre><p><strong>Example 2:</strong></p>
|
|
<pre><strong>Input:</strong> timePoints = ["00:00","23:59","00:00"]
|
|
<strong>Output:</strong> 0
|
|
</pre>
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>2 <= timePoints.length <= 2 * 10<sup>4</sup></code></li>
|
|
<li><code>timePoints[i]</code> is in the format <strong>"HH:MM"</strong>.</li>
|
|
</ul>
|