coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41: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

6
leetcode/problem/car-fleet.html
View File

@@ -11,7 +11,7 @@
<p>Return <em>the <strong>number of car fleets</strong> that will arrive at the destination</em>.</p>
<p>&nbsp;</p>
<p><strong>Example 1:</strong></p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong> target = 12, position = [10,8,0,5,3], speed = [2,4,1,1,3]
@@ -23,7 +23,7 @@ The cars starting at 5 (speed 1) and 3 (speed 3) become a fleet, meeting each ot
Note that no other cars meet these fleets before the destination, so the answer is 3.
</pre>
<p><strong>Example 2:</strong></p>
<p><strong class="example">Example 2:</strong></p>
<pre>
<strong>Input:</strong> target = 10, position = [3], speed = [3]
@@ -31,7 +31,7 @@ Note that no other cars meet these fleets before the destination, so the answer
<strong>Explanation:</strong> There is only one car, hence there is only one fleet.
</pre>
<p><strong>Example 3:</strong></p>
<p><strong class="example">Example 3:</strong></p>
<pre>
<strong>Input:</strong> target = 100, position = [0,2,4], speed = [4,2,1]