Steward

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

程式語言 - LeetCode - C++ - 435. Non-overlapping Intervals

---

參考資訊：
https://www.cnblogs.com/grandyang/p/6017505.html

題目：


解答：

class Solution {
public:
    int eraseOverlapIntervals(vector<vector<int>>& intervals) {
        sort(intervals.begin(), intervals.end());

        int r = 0;
        int last = 0;
        for (int i = 1; i < intervals.size(); i++) {
            if (intervals[i][0] < intervals[last][1]) {
                r += 1;
                if (intervals[i][1] < intervals[last][1]) {
                    last = i;
                }
            } else {
                last = i;
            }
        }

        return r;
    }
};