mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 19:53:12 +08:00
32 lines
1.5 KiB
HTML
32 lines
1.5 KiB
HTML
<p>You are given a 2D integer array <code>logs</code> where each <code>logs[i] = [birth<sub>i</sub>, death<sub>i</sub>]</code> indicates the birth and death years of the <code>i<sup>th</sup></code> person.</p>
|
|
|
|
<p>The <strong>population</strong> of some year <code>x</code> is the number of people alive during that year. The <code>i<sup>th</sup></code> person is counted in year <code>x</code>'s population if <code>x</code> is in the <strong>inclusive</strong> range <code>[birth<sub>i</sub>, death<sub>i</sub> - 1]</code>. Note that the person is <strong>not</strong> counted in the year that they die.</p>
|
|
|
|
<p>Return <em>the <strong>earliest</strong> year with the <strong>maximum population</strong></em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> logs = [[1993,1999],[2000,2010]]
|
|
<strong>Output:</strong> 1993
|
|
<strong>Explanation:</strong> The maximum population is 1, and 1993 is the earliest year with this population.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> logs = [[1950,1961],[1960,1971],[1970,1981]]
|
|
<strong>Output:</strong> 1960
|
|
<strong>Explanation:</strong>
|
|
The maximum population is 2, and it had happened in years 1960 and 1970.
|
|
The earlier year between them is 1960.</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= logs.length <= 100</code></li>
|
|
<li><code>1950 <= birth<sub>i</sub> < death<sub>i</sub> <= 2050</code></li>
|
|
</ul>
|