Skip to content

Commit

Permalink
New Problem Solution - "1854. Maximum Population Year"
Browse files Browse the repository at this point in the history
  • Loading branch information
haoel committed May 9, 2021
1 parent 7cbd02a commit a78c679
Show file tree
Hide file tree
Showing 2 changed files with 60 additions and 0 deletions.
1 change: 1 addition & 0 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -9,6 +9,7 @@ LeetCode

| # | Title | Solution | Difficulty |
|---| ----- | -------- | ---------- |
|1854|[Maximum Population Year](https://leetcode.com/problems/maximum-population-year/) | [C++](./algorithms/cpp/maximumPopulationYear/MaximumPopulationYear.cpp)|Easy|
|1851|[Minimum Interval to Include Each Query](https://leetcode.com/problems/minimum-interval-to-include-each-query/) | [C++](./algorithms/cpp/minimumIntervalToIncludeEachQuery/MinimumIntervalToIncludeEachQuery.cpp)|Hard|
|1850|[Minimum Adjacent Swaps to Reach the Kth Smallest Number](https://leetcode.com/problems/minimum-adjacent-swaps-to-reach-the-kth-smallest-number/) | [C++](./algorithms/cpp/minimumAdjacentSwapsToReachTheKthSmallestNumber/MinimumAdjacentSwapsToReachTheKthSmallestNumber.cpp)|Medium|
|1849|[Splitting a String Into Descending Consecutive Values](https://leetcode.com/problems/splitting-a-string-into-descending-consecutive-values/) | [C++](./algorithms/cpp/splittingAStringIntoDescendingConsecutiveValues/SplittingAStringIntoDescendingConsecutiveValues.cpp)|Medium|
Expand Down
59 changes: 59 additions & 0 deletions algorithms/cpp/maximumPopulationYear/MaximumPopulationYear.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,59 @@
// Source : https://leetcode.com/problems/maximum-population-year/
// Author : Hao Chen
// Date : 2021-05-09

/*****************************************************************************************************
*
* You are given a 2D integer array logs where each logs[i] = [birthi, deathi] indicates the birth and
* death years of the i^th person.
*
* The population of some year x is the number of people alive during that year. The i^th 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) {
vector<vector<int>> year;

for(auto& log : logs) {
year.push_back({log[0], 1});
year.push_back({log[1], -1});
}
sort(year.begin(), year.end());

int x = year[0][0];
int cnt = 0, max_cnt = 0;
for(int i=0; i< year.size(); i++) {
cnt += year[i][1];
if (max_cnt < cnt) {
max_cnt = cnt;
x = year[i][0];
}
}
return x;
}
};

0 comments on commit a78c679

Please sign in to comment.