-
Notifications
You must be signed in to change notification settings - Fork 22
Expand file tree
/
Copy path1854.maximum-population-year.cpp
More file actions
53 lines (50 loc) · 1.54 KB
/
1854.maximum-population-year.cpp
File metadata and controls
53 lines (50 loc) · 1.54 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
// Tag: Array, Counting, Prefix Sum, Line Sweep
// Time: O(NlogN)
// Space: O(N)
// Ref: -
// Note: -
// You are given a 2D integer array logs where each logs[i] = [birthi, deathi] indicates the birth and death years of the ith person.
// The population of some year x is the number of people alive during that year. The ith person is counted in year x's population if x is in the inclusive range [birthi, deathi - 1]. Note that the person is not counted in the year that they die.
// Return the earliest year with the maximum population.
//
// Example 1:
//
// Input: logs = [[1993,1999],[2000,2010]]
// Output: 1993
// Explanation: The maximum population is 1, and 1993 is the earliest year with this population.
//
// Example 2:
//
// Input: logs = [[1950,1961],[1960,1971],[1970,1981]]
// Output: 1960
// Explanation:
// The maximum population is 2, and it had happened in years 1960 and 1970.
// The earlier year between them is 1960.
//
// Constraints:
//
// 1 <= logs.length <= 100
// 1950 <= birthi < deathi <= 2050
//
//
class Solution {
public:
int maximumPopulation(vector<vector<int>>& logs) {
map<int, int> lines;
for (auto &log: logs) {
lines[log[0]] += 1;
lines[log[1]] -= 1;
}
int count = 0;
int max_count = 0;
int res = 0;
for (auto& i: lines) {
count += i.second;
if (count > max_count) {
max_count = count;
res = i.first;
}
}
return res;
}
};