Steward

分享是一種喜悅、更是一種幸福

程式語言 - LeetCode - C++ - 436. Find Right Interval

---

題目：


解答：

class Solution {
public:
    vector<int> findRightInterval(vector<vector<int>>& intervals) {
        int n = intervals.size();
        vector<pair<int, int>> start;

        for (int i = 0; i < n; ++i) {
            start.push_back({intervals[i][0], i});
        }

        sort(start.begin(), start.end());
        vector<int> ans(n, -1);

        for (int i = 0; i < n; ++i) {
            int t = intervals[i][1];

            auto it = lower_bound(start.begin(), start.end(), make_pair(t, -1));
            if (it != start.end()) {
                ans[i] = it->second;
            }
        }

        return ans;
    }
};