Day31 贪心专项

最新推荐文章于 2024-07-12 18:12:33 发布

DuanDuan0820

最新推荐文章于 2024-07-12 18:12:33 发布

阅读量30

点赞数

分类专栏：算法学习文章标签： leetcode c++ 数据结构算法

本文链接：https://blog.csdn.net/DuanDuan0820/article/details/130879020

版权

算法学习专栏收录该内容

52 篇文章 0 订阅

订阅专栏

435. 无重叠区间

class Solution {
public:
    int eraseOverlapIntervals(vector<vector<int>>& intervals) {
        if (intervals.size() == 0) {return 0;}

        sort(intervals.begin(), intervals.end(),[](const vector<int> &l, const vector<int> &r){
            return l[1] < r[1];
        });

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

        return ret;
    }
};

56. 合并区间

class Solution {
public:
    vector<vector<int>> merge(vector<vector<int>>& intervals) {
        vector<vector<int>> ret;

        if (intervals.size() == 0) return ret;

        sort(intervals.begin(), intervals.end(), [](vector<int> l, vector<int> r){ return l[0] < r[0];});

        int left = intervals[0][0], right = intervals[0][1];
        ret.push_back({left, right});
        for (int i = 1; i < intervals.size(); i++) {
            if (intervals[i][0] <= ret.back()[1]) {
                ret.back()[1] = max(ret.back()[1], intervals[i][1]);
            } else {
                ret.push_back({intervals[i][0], intervals[i][1]});
            }
        }

        return ret;
    }
};