Leetcode 贪心算法（四）

452. 用最少数量的箭引爆气球

力扣题目链接

class Solution {
public:
    static bool cmp(const vector<int> a, const vector<int>& b){
        return a[0] < b[0];
    }
    int findMinArrowShots(vector<vector<int>>& points) {
        if(points.size() == 0)  return 0;
        sort(points.begin(), points.end(), cmp);
        int result = 1;
        for(int i = 1; i < points.size(); i++){
            if(points[i][0] > points[i - 1][1]){
                result++;
            }
            else{
                points[i][1] = min(points[i - 1][1], points[i][1]);
            }
        }      
    return result;
    }
};

435. 无重叠区间

力扣题目链接

class Solution {
public:
    static bool cmp(vector<int>& a, vector<int>& b){
        return a[1] < b [1];
    }
    int eraseOverlapIntervals(vector<vector<int>>& intervals) {
        if(intervals.size() == 0)  return 0;
        sort(intervals.begin(), intervals.end(), cmp);
        int count = 1;
        int end = intervals[0][1];
        for(int i = 1; i < intervals.size(); i++){
            if(end <= intervals[i][0]){
                end = intervals[i][1];
                count++;
            }
        }
        return intervals.size() - count;
    }
};

763. 划分字母区间

力扣题目链接

class 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;
        int right = 0;
        for(int i = 0; i < s.size(); i++){
            right = max(right, hash[s[i] - 'a']);
            if(i == right){
                result.push_back(right - left + 1);
                left = i + 1;
            }
        }
        return result;
    }
};

56. 合并区间

力扣题目链接

class Solution {
public:
    static bool cmp(const vector<int>& a, const vector<int>& b){
        return a[0] < b[0];
    }
    vector<vector<int>> merge(vector<vector<int>>& intervals) {
        vector<vector<int>> result;
        if(intervals.size() == 0)   return result;
        sort(intervals.begin(), intervals.end(), cmp);
        bool flag = false;
        for(int i = 1; i < intervals.size(); i++){
            int start = intervals[i - 1][0];
            int end = intervals[i - 1][1];
            while(i < intervals.size() && intervals[i][0] <= end){
                end = max(end, intervals[i][1]);
                if(i == intervals.size() - 1)   flag = true;
                i++;
            }
            result.push_back({start,end});
        }
        if(flag == false){
            result.push_back({intervals[intervals.size() - 1][0], intervals[intervals.size() - 1][1]});
        }
        return result;
    }
};