day30（代码随想录补卡） 452. 用最少数量的箭引爆气球| 435. 无重叠区间 |763.划分字母区间

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

https://leetcode.cn/problems/minimum-number-of-arrows-to-burst-balloons/description/

class Solution {
private:
    static bool cmp(const vector<int>& a, const vector<int>& b) {
        return a[0] < b[0];
    }
public:
    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. 无重叠区间 

https://leetcode.cn/problems/non-overlapping-intervals/description/

class Solution {
public:
    
    static bool cmp (const vector<int>& a, const 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.划分字母区间

https://leetcode.cn/problems/partition-labels/description/

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;
    }
};