LeetCode-1288. Remove Covered Intervals

Given a list of intervals, remove all intervals that are covered by another interval in the list. Interval [a,b) is covered by interval [c,d) if and only if c <= a and b <= d.

After doing so, return the number of remaining intervals.

 

Example 1:

Input: intervals = [[1,4],[3,6],[2,8]]
Output: 2
Explanation: Interval [3,6] is covered by [2,8], therefore it is removed.

 

Constraints:

• 1 <= intervals.length <= 1000
• 0 <= intervals[i][0] < intervals[i][1] <= 10^5
• intervals[i] != intervals[j] for all i != j

题解：

暴力枚举，去重。

class Solution {
public:
    int removeCoveredIntervals(vector<vector<int>>& intervals) {
        if (intervals.empty() == true) {
            return 0;
        }
        int res = 0;
        sort(intervals.begin(), intervals.end());
        for (int i = 0; i < intervals.size(); i++) {
            for (int j = i + 1; j < intervals.size(); j++) {
                if (intervals[i] != intervals[j]) {
                    if (intervals[i][0] <= intervals[j][0] && intervals[i][1] >= intervals[j][1]) {
                        intervals[j][0] = -1;
                        intervals[j][1] = -1;
                        res++;
                    }
                }
            }
        }
        return intervals.size() - res;
    }
};