coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 16:31:42 +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

6
leetcode/problem/minimum-skips-to-arrive-at-meeting-on-time.html
View File

@@ -15,7 +15,7 @@
<p>Return <em>the <strong>minimum number of skips required</strong> to arrive at the meeting on time, or</em> <code>-1</code><em> if it is<strong> impossible</strong></em>.</p>
<p>&nbsp;</p>
<p><strong>Example 1:</strong></p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong> dist = [1,3,2], speed = 4, hoursBefore = 2
@@ -26,7 +26,7 @@ You can skip the first rest to arrive in ((1/4 + <u>0</u>) + (3/4 + 0)) + (2/4)
Note that the second rest is shortened because you finish traveling the second road at an integer hour due to skipping the first rest.
</pre>
<p><strong>Example 2:</strong></p>
<p><strong class="example">Example 2:</strong></p>
<pre>
<strong>Input:</strong> dist = [7,3,5,5], speed = 2, hoursBefore = 10
@@ -36,7 +36,7 @@ Without skipping any rests, you will arrive in (7/2 + 1/2) + (3/2 + 1/2) + (5/2
You can skip the first and third rest to arrive in ((7/2 + <u>0</u>) + (3/2 + 0)) + ((5/2 + <u>0</u>) + (5/2)) = 10 hours.
</pre>
<p><strong>Example 3:</strong></p>
<p><strong class="example">Example 3:</strong></p>
<pre>
<strong>Input:</strong> dist = [7,3,5,5], speed = 1, hoursBefore = 10