coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-21 13:06:47 +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

12
leetcode-cn/problem (Chinese)/生存人数 [living-people-lcci].html
View File

@@ -4,22 +4,22 @@
<p>如果有多个年份生存人数相同且均为最大值，输出其中最小的年份。</p>
<p> </p>
<p>&nbsp;</p>
<p><strong>示例：</strong></p>
<pre>
<strong>输入：</strong>
birth = {1900, 1901, 1950}
death = {1948, 1951, 2000}
birth = [1900, 1901, 1950]
death = [1948, 1951, 2000]
<strong>输出：</strong> 1901
</pre>
<p> </p>
<p>&nbsp;</p>
<p><strong>提示：</strong></p>
<ul>
<li><code>0 < birth.length == death.length <= 10000</code></li>
<li><code>birth[i] <= death[i]</code></li>
<li><code>0 &lt; birth.length == death.length &lt;= 10000</code></li>
<li><code>birth[i] &lt;= death[i]</code></li>
</ul>