coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-11 18:31:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
leetcode-cn/problem (Chinese)/最小时间差 [569nqc].html
View File

@@ -1,18 +1,18 @@
<p>给定一个 24 小时制（小时:分钟 <strong>&quot;HH:MM&quot;</strong>）的时间列表，找出列表中任意两个时间的最小时间差并以分钟数表示。</p>
<p>给定一个 24 小时制（小时:分钟 <strong>"HH:MM"</strong>）的时间列表，找出列表中任意两个时间的最小时间差并以分钟数表示。</p>
<p>&nbsp;</p>
<p><strong>示例 1：</strong></p>
<pre>
<strong>输入：</strong>timePoints = [&quot;23:59&quot;,&quot;00:00&quot;]
<strong>输入：</strong>timePoints = ["23:59","00:00"]
<strong>输出：</strong>1
</pre>
<p><strong>示例 2：</strong></p>
<pre>
<strong>输入：</strong>timePoints = [&quot;00:00&quot;,&quot;23:59&quot;,&quot;00:00&quot;]
<strong>输入：</strong>timePoints = ["00:00","23:59","00:00"]
<strong>输出：</strong>0
</pre>
@@ -21,8 +21,8 @@
<p><strong>提示：</strong></p>
<ul>
<li><code>2 &lt;= timePoints &lt;= 2 * 10<sup>4</sup></code></li>
<li><code>timePoints[i]</code> 格式为 <strong>&quot;HH:MM&quot;</strong></li>
<li><code>2 &lt;= timePoints.length&nbsp;&lt;= 2 * 10<sup>4</sup></code></li>
<li><code>timePoints[i]</code> 格式为 <strong>"HH:MM"</strong></li>
</ul>
<p>&nbsp;</p>