Today I have done leetcode's October LeetCoding Challenge with cpp.

October LeetCoding Challenge 11

Description

Number of Flowers in Full Bloom

You are given a 0-indexed 2D integer array flowers, where flowers[i] = [starti, endi] means the ith flower will be in full bloom from starti to endi (inclusive). You are also given a 0-indexed integer array people of size n, where people[i] is the time that the ith person will arrive to see the flowers.

Return an integer array answer of size n, where answer[i] is the number of flowers that are in full bloom when the ith person arrives.

Example 1:

Input: flowers = [[1,6],[3,7],[9,12],[4,13]], poeple = [2,3,7,11]
Output: [1,2,2,2]
Explanation: The figure above shows the times when the flowers are in full bloom and when the people arrive.
For each person, we return the number of flowers in full bloom during their arrival.

Example 2:

Input: flowers = [[1,10],[3,3]], poeple = [3,3,2]
Output: [2,2,1]
Explanation: The figure above shows the times when the flowers are in full bloom and when the people arrive.
For each person, we return the number of flowers in full bloom during their arrival.

Constraints:

• 1 <= flowers.length <= 5 * 104
• flowers[i].length == 2
• 1 <= starti <= endi <= 109
• 1 <= people.length <= 5 * 104
• 1 <= people[i] <= 109

Solution

class Solution {
public:
  vector<int> fullBloomFlowers(vector<vector<int>>& flowers, vector<int>& people) {
    map<int, int> flowersAbs;
    for(const auto &flower : flowers) {
      flowersAbs[flower[0]] += 1;
      flowersAbs[flower[1] + 1] -= 1;
    }
    vector<int> indice(people.size());
    for(int i = 1; i < people.size(); ++i) {
      indice[i] = i;
    }
    sort(indice.begin(), indice.end(), [&](int a, int b) {
      return people[a] < people[b];
    });
    vector<int> answer(people.size());

    auto it = flowersAbs.begin();
    int flower = 0;
    for(auto index : indice) {
      while(it != flowersAbs.end() && it->first <= people[index]) {
        flower += it->second;
        ++it;
      }
      answer[index] = flower;
    }

    return answer;
  }
};

// Accepted
// 52/52 cases passed (284 ms)
// Your runtime beats 31.94 % of cpp submissions
// Your memory usage beats 60.07 % of cpp submissions (87 MB)