mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
20 lines
892 B
HTML
20 lines
892 B
HTML
<p>Given a list of people with their birth and death years, implement a method to compute the year with the most number of people alive. You may assume that all people were born between 1900 and 2000 (inclusive). If a person was alive during any portion of that year, they should be included in that year's count. For example, Person (birth= 1908, death= 1909) is included in the counts for both 1908 and 1909.</p>
|
|
|
|
|
|
|
|
<p>If there are more than one years that have the most number of people alive, return the smallest one.</p>
|
|
|
|
|
|
|
|
<p><strong>Example: </strong></p>
|
|
|
|
|
|
|
|
<pre>
|
|
|
|
<strong>Input: </strong>
|
|
|
|
birth = {1900, 1901, 1950}
|
|
|
|
death = {1948, 1951, 2000}
|
|
|
|
<strong>Output: </strong> 1901
|
|
|
|
</pre>
|
|
|
|
|
|
|
|
<p><strong>Note: </strong></p>
|
|
|
|
|
|
|
|
<ul>
|
|
|
|
<li><code>0 < birth.length == death.length <= 10000</code></li>
|
|
|
|
<li><code>birth[i] <= death[i]</code></li>
|
|
|
|
</ul>
|
|
|