minimum-time-difference

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given a list of 24-hour clock time points in &quot;HH:MM&quot; format, return the minimum minutes difference between any two time-points in the list.
&nbsp;
Example 1:
<pre>Input: timePoints = ["23:59","00:00"]
Output: 1
</pre>Example 2:
<pre>Input: timePoints = ["00:00","23:59","00:00"]
Output: 0
</pre>
&nbsp;
Constraints:

<ul>
	<li><code>2 &lt;= timePoints.length &lt;= 2 * 104</code></li>
	<li><code>timePoints[i]</code> is in the format &quot;HH:MM&quot;.</li>
</ul>

findMinDifference

Minimum Time Difference

Minimum Cost to Set Cooking Time

minimum-cost-to-set-cooking-time

设置时间的最少代价

Array

Math

String

Sorting

给定一个 24 小时制（小时:分钟 "HH:MM"）的时间列表，找出列表中任意两个时间的最小时间差并以分钟数表示。

&nbsp;

示例 1：

<pre>
输入：timePoints = ["23:59","00:00"]
输出：1
</pre>

示例 2：

<pre>
输入：timePoints = ["00:00","23:59","00:00"]
输出：0
</pre>

&nbsp;

提示：

<ul>
	<li><code>2 &lt;= timePoints.length &lt;= 2 * 104</code></li>
	<li><code>timePoints[i]</code> 格式为 "HH:MM"</li>
</ul>