代码随想录算法训练营第30天

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

链接

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

LeetCode 435. 无重叠区间

链接

class Solution {
public:
    int eraseOverlapIntervals(vector<vector<int>>& intervals) {
        sort(intervals.begin(), intervals.end(), [](vector<int>& a, vector<int>& b) {
            if(a[1] == b[1]) {
                return a[0] < b[0];
            }
            return a[1] < b[1];
        });
        // 如果end相同，移除start小
        int res = 0;	// 记录移除区间数
        for(int i = 0; i < intervals.size() - 1; i++) {
            int cur_start = intervals[i][0], cur_end = intervals[i][1];
            while(i < intervals.size() - 1 && intervals[i + 1][0] < cur_end) {
                    i++, res++;
            }
        }
        return res;
    }
};

class Solution {
public:
    int eraseOverlapIntervals(vector<vector<int>>& intervals) {
        sort(intervals.begin(), intervals.end(), [](vector<int>& a, vector<int>& b) {
            if(a[1] == b[1]) {
                return a[0] < b[0];
            }
            return a[1] < b[1];
        });
        
        int count = 1;  // 记录非交叉区间
        int cur_end = intervals[0][1];
        for(int i = 1; i < intervals.size(); i++) {
            if(cur_end <= intervals[i][0]) {
                cur_end = intervals[i][1];
                count++;
            }
        }
        return intervals.size() - count;
    }
};

LeetCode 763. 划分字母区间

链接

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

    }
};