mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
27 lines
673 B
HTML
27 lines
673 B
HTML
<p>给定一个 24 小时制（小时:分钟 <strong>"HH:MM"</strong>）的时间列表，找出列表中任意两个时间的最小时间差并以分钟数表示。</p>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>示例 1：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入：</strong>timePoints = ["23:59","00:00"]
|
||
<strong>输出：</strong>1
|
||
</pre>
|
||
|
||
<p><strong>示例 2：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入：</strong>timePoints = ["00:00","23:59","00:00"]
|
||
<strong>输出：</strong>0
|
||
</pre>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>提示：</strong></p>
|
||
|
||
<ul>
|
||
<li><code>2 <= timePoints.length <= 2 * 10<sup>4</sup></code></li>
|
||
<li><code>timePoints[i]</code> 格式为 <strong>"HH:MM"</strong></li>
|
||
</ul>
|