36代码随想录训练营day36|贪心算法part05

1、无重叠区间

无重叠区间

class Solution {
public:
    static bool cmp(vector<int>& a, vector<int>& b) {
        return a[0] < b[0];
    }
    int eraseOverlapIntervals(vector<vector<int>>& intervals) {
        sort(intervals.begin(), intervals.end(), cmp);
        int count = 0;
        for (int i = 1; i < intervals.size(); i++) {
            if (intervals[i][0] < intervals[i - 1][1]) {
                count++;
                // min()防止出现区间过大，包含所有
                intervals[i][1] = min(intervals[i][1], intervals[i - 1][1]);
            }
        }
        return count;
    }
};

2、划分字母区间

划分字母区间

lass Solution {
public:
    vector<int> partitionLabels(string s) {
        int hash[27] = {0};
        for (int i = 0; i < s.size(); i++) {
            hash[s[i] - 'a'] = i;
        }
        vector<int> result;
        int left = 0, right = 0;
        for (int i = 0; i < s.size(); i++) {
            right = max(right, hash[s[i] - 'a']);
            if (right == i) {
                result.push_back(right - left + 1);
                left = i + 1;
            }
        }
        return result;
    }
};

3、合并区间

合并区间

该方法自己做的，但不建议

class Solution {
public:
    static bool cmp(vector<int>& a, vector<int>& b) {
        return a[0] < b[0];
    }
    vector<vector<int>> merge(vector<vector<int>>& intervals) {
        vector<vector<int>> result;
        vector<int> vec;
        // 不建议，多加了这个
        int a = INT_MAX;
        sort(intervals.begin(), intervals.end(), cmp);
        intervals.push_back({a, a});
        int left = intervals[0][0], right = intervals[0][1];
        // for循环导致最后一个元素只能在else处理，而else处理的是i-1个元素，会遗漏
        for (int i = 1; i < intervals.size(); i++) {
            if (intervals[i][0] <= intervals[i - 1][1]) {
                right = max(right, intervals[i][1]);
                intervals[i][1] = right;
            } else {
                vec.push_back(left);
                vec.push_back(right);
                result.push_back(vec);
                vec.clear();
                right = intervals[i][1];
                left = intervals[i][0];
            }
        }
        return result;
    }
};

class Solution {
public:
    vector<vector<int>> merge(vector<vector<int>>& intervals) {
        vector<vector<int>> result;
        if (intervals.size() == 0) return result; // 区间集合为空直接返回
        // 排序的参数使用了lambda表达式
        sort(intervals.begin(), intervals.end(), [](const vector<int>& a, const vector<int>& b){return a[0] < b[0];});

        // 第一个区间就可以放进结果集里，后面如果重叠，在result上直接合并
        result.push_back(intervals[0]); 

        for (int i = 1; i < intervals.size(); i++) {
            if (result.back()[1] >= intervals[i][0]) { // 发现重叠区间
                // 合并区间，只更新右边界就好，因为result.back()的左边界一定是最小值，因为我们按照左边界排序的
                result.back()[1] = max(result.back()[1], intervals[i][1]); 
            } else {
                result.push_back(intervals[i]); // 区间不重叠 
            }
        }
        return result;
    }
};