leetcode 436. Find Right Interval

最新推荐文章于 2023-01-24 17:24:45 发布

liqinzhe223

最新推荐文章于 2023-01-24 17:24:45 发布

阅读量158

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/liqinzhe11/article/details/79010227

版权

leetcode 专栏收录该内容

280 篇文章 0 订阅

订阅专栏

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:

You may assume the interval's end point is always bigger than its start point.
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.

1、compare函数后面不能加const，只有类的成员函数可以加。

2、对原数组按照end从小到大排序，这样挨个在map中找对应的时候就不需要每次都从头到尾搜索map，只需要一个map迭代器指针往后移动就可以，把复杂度从O(n^2) 编成O(n)

3、并且map中存了start->i的映射，排序后也不会影响ret输出结果。只要按照原先的索引把返回值更改就可以。

/**
 * Definition for an interval.
 * struct Interval {
 *     int start;
 *     int end;
 *     Interval() : start(0), end(0) {}
 *     Interval(int s, int e) : start(s), end(e) {}
 * };
 */
bool compare(const Interval& a, const Interval& b)
{
    return a.end < b.end;
}

class Solution {
public:
    vector<int> findRightInterval(vector<Interval>& intervals)
    {
        vector<int> ret(intervals.size(), -1);
        map<int, int> index;
        for (int i = 0; i < intervals.size(); i++)
            index[intervals[i].start] = i;

        sort(intervals.begin(), intervals.end(), compare);
        
        auto it = index.begin();

        for (int i = 0; i < intervals.size(); i++)
        {
            int endpoint = intervals[i].end;

            if (endpoint > index.rbegin()->first)  continue;

            for (; it != index.end(); it++)
            {
                if (endpoint <= it->first)
                {
                    ret[index[intervals[i].start]] = it->second;
                    break;
                }
            }
        }
        return ret;
    }
};