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

批量更新数据

Browse Source
This commit is contained in:
小墨
2025-01-09 20:29:41 +08:00
parent 04ecea043d
commit 48cdd06c2b
5053 changed files with 156164 additions and 135322 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
leetcode-cn/problem (Chinese)/坐上公交的最晚时间 [the-latest-time-to-catch-a-bus].html
View File

@@ -2,7 +2,7 @@
<p>给你一个整数&nbsp;<code>capacity</code>&nbsp;，表示每辆公交车&nbsp;<strong>最多</strong>&nbsp;能容纳的乘客数目。</p>
<p>每位乘客都会搭乘下一辆有座位的公交车。如果你在 <code>y</code>&nbsp;时刻到达，公交在&nbsp;<code>x</code>&nbsp;时刻出发，满足&nbsp;<code>y &lt;= x</code>&nbsp;&nbsp;且公交没有满，那么你可以搭乘这一辆公交。<strong>最早</strong>&nbsp;到达的乘客优先上车。</p>
<p>每位乘客都会排队搭乘下一辆有座位的公交车。如果你在 <code>y</code>&nbsp;时刻到达，公交在&nbsp;<code>x</code>&nbsp;时刻出发，满足&nbsp;<code>y &lt;= x</code>&nbsp;&nbsp;且公交没有满，那么你可以搭乘这一辆公交。<strong>最早</strong>&nbsp;到达的乘客优先上车。</p>
<p>返回你可以搭乘公交车的最晚到达公交站时间。你 <strong>不能</strong>&nbsp;跟别的乘客同时刻到达。</p>
@@ -12,7 +12,8 @@
<p><strong>示例 1：</strong></p>
<pre><b>输入：</b>buses = [10,20], passengers = [2,17,18,19], capacity = 2
<pre>
<b>输入：</b>buses = [10,20], passengers = [2,17,18,19], capacity = 2
<b>输出：</b>16
<strong>解释：</strong>
第 1 辆公交车载着第 1 位乘客。
@@ -21,7 +22,8 @@
<p><strong>示例 2：</strong></p>
<pre><b>输入：</b>buses = [20,30,10], passengers = [19,13,26,4,25,11,21], capacity = 2
<pre>
<b>输入：</b>buses = [20,30,10], passengers = [19,13,26,4,25,11,21], capacity = 2
<b>输出：</b>20
<b>解释：</b>
第 1 辆公交车载着第 4 位乘客。