leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

2251.cpp (819B)

0 class Solution { 1 public: 2 vector<int> fullBloomFlowers(const vector<vector<int>> &flowers, const vector<int> &people) const { 3 vector<int> start, finish, res; 4 5 start.reserve(flowers.size()); 6 finish.reserve(flowers.size()); 7 for (const auto &flower : flowers) { 8 start.push_back(flower[0]); 9 finish.push_back(flower[1] + 1); 10 } 11 12 sort(begin(start), end(start)); 13 sort(begin(finish), end(finish)); 14 15 res.reserve(people.size()); 16 for (const int person : people) { 17 const int left = upper_bound(begin(start), end(start), person) - begin(start); 18 const int right = upper_bound(begin(finish), end(finish), person) - begin(finish); 19 res.push_back(left - right); 20 } 21 return res; 22 } 23 };