LeetCode - 436 - Find Right Interval

Given a set of intervals, for each of the interval i, check if there exists an interval j whose start point is bigger than or equal to the end point of the interval i, which can be called that j is on the "right" of i.

For any interval i, you need to store the minimum interval j's index, which means that the interval j has the minimum start point to build the "right" relationship for interval i. If the interval j doesn't exist, store -1 for the interval i. Finally, you need output the stored value of each interval as an array.

Note:

1. You may assume the interval's end point is always bigger than its start point.
2. You may assume none of these intervals have the same start point.

Example 1:

Input: [ [1,2] ]

Output: [-1]

Explanation: There is only one interval in the collection, so it outputs -1.

Example 2:

Input: [ [3,4], [2,3], [1,2] ]

Output: [-1, 0, 1]

Explanation: There is no satisfied "right" interval for [3,4].
For [2,3], the interval [3,4] has minimum-"right" start point;
For [1,2], the interval [2,3] has minimum-"right" start point.

Example 3:

Input: [ [1,4], [2,3], [3,4] ]

Output: [-1, 2, -1]

Explanation: There is no satisfied "right" interval for [1,4] and [3,4].
For [2,3], the interval [3,4] has minimum-"right" start point.

Subscribe to see which companies asked this question.

题意：对于每个区间，找到一个start >= 该区间end值的区间，并且在他右边且离他最近

思路：按start值排序，然后扫一遍，平均复杂度有O(nlogn)，不过感觉会退化到o(n^2)

顺便学了一下vector排序（拉下的总会让你补上，没得跑。。。）

/**
 * Definition for an interval.
 * struct Interval {
 *     int start;
 *     int end;
 *     Interval() : start(0), end(0) {}
 *     Interval(int s, int e) : start(s), end(e) {}
 * };
 */
class Solution {
public:
    static bool cmp(const pair<Interval, int> a, const pair<Interval, int> b) {
        if (a.first.start == b.first.start)
            return a.first.end < b.first.end;
        return a.first.start < b.first.start;
    }
    
    vector<int> findRightInterval(vector<Interval>& a) {
         vector<pair<Interval, int>> m;
         int len = a.size();
         vector<int> ans(len, -1);
         for (int i = 0; i < len; i++) {
             m.push_back(pair<Interval, int>(a[i], i));
         }
         sort(m.begin(), m.end(), cmp);
         for (int i = 0; i < len; i++) {
             for (int j = i + 1; j < len; j++) {
                 if (m[j].first.start >= m[i].first.end) {
                     ans[m[i].second] = m[j].second;
                     break;
                 }
             }
         }
         return ans;
    }
};