代码随想录算法训练营第三十九天 |452. 用最少数量的箭引爆气球 738.单调递增的数 968.监控二叉树(一刷跳过) 435. 无重叠区间 763.划分字母区间 56. 合并区间

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

题目链接：https://leetcode.cn/problems/minimum-number-of-arrows-to-burst-balloons/

文章讲解：https://programmercarl.com/0452.%E7%94%A8%E6%9C%80%E5%B0%91%E6%95%B0%E9%87%8F%E7%9A%84%E7%AE%AD%E5%BC%95%E7%88%86%E6%B0%94%E7%90%83.html

视频讲解：https://www.bilibili.com/video/BV1ev4y1C7na/

// short int long float double bool char string void
// array vector stack queue auto const operator
// class public private static friend extern
// sizeof new delete return cout cin memset malloc
// relloc size length memset malloc relloc size length
// for while if else switch case continue break system
// endl reverse sort swap substr begin end iterator
// namespace include define NULL nullptr exit equals
// index col row arr err left right ans res vec que sta
// state flag ch str max min default charray std
// maxn minn INT_MAX INT_MIN push_back insert
// back empty find pop_back
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],points[i-1][1]);
            }
        }
        return result;
    }
};

435. 无重叠区间

题目链接：https://leetcode.cn/problems/non-overlapping-intervals/

文章讲解：https://programmercarl.com/0435.%E6%97%A0%E9%87%8D%E5%8F%A0%E5%8C%BA%E9%97%B4.html

视频讲解：https://www.bilibili.com/video/BV1A14y1c7E1/

// short int long float double bool char string void
// array vector stack queue auto const operator
// class public private static friend extern
// sizeof new delete return cout cin memset malloc
// relloc size length memset malloc relloc size length
// for while if else switch case continue break system
// endl reverse sort swap substr begin end iterator
// namespace include define NULL nullptr exit equals
// index col row arr err left right ans res vec que sta
// state flag ch str max min default charray std
// maxn minn INT_MAX INT_MIN push_back insert
// back empty find pop_back
class Solution {
private:
    static bool cmp(const vector<int> &a , const vector<int> &b)
    {
        return a[0] < b[0];
    }
public:
    int eraseOverlapIntervals(vector<vector<int>>& intervals) {
        if(intervals.size() == 0 )
        {
            return 0;
        }
        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])
            {
                
                intervals[i][1] =  min(intervals[i][1],intervals[i-1][1]);
                count ++;
            }

        }
        return count;
    }
};

763.划分字母区间

题目链接：https://leetcode.cn/problems/partition-labels/

文章讲解：https://programmercarl.com/0763.%E5%88%92%E5%88%86%E5%AD%97%E6%AF%8D%E5%8C%BA%E9%97%B4.html#%E6%80%9D%E8%B7%AF

视频讲解：https://www.bilibili.com/video/BV18G4y1K7d5/?vd_source=5287cb6df25410935566fc8f0d951a5a

// short int long float double bool char string void
// array vector stack queue auto const operator
// class public private static friend extern
// sizeof new delete return cout cin memset malloc
// relloc size length memset malloc relloc size length
// for while if else switch case continue break system
// endl reverse sort swap substr begin end iterator
// namespace include define NULL nullptr exit equals
// index col row arr err left right ans res vec que sta
// state flag ch str max min default charray std
// maxn minn INT_MAX INT_MIN push_back insert
// back empty find pop_back
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;
        }

        int left = 0,right = 0;
        vector<int> result;
        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. 合并区间

题目链接：https://leetcode.cn/problems/merge-intervals/

文章讲解：https://programmercarl.com/0056.%E5%90%88%E5%B9%B6%E5%8C%BA%E9%97%B4.html

视频讲解：https://www.bilibili.com/video/BV1wx4y157nD/

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

738.单调递增的数字

题目链接：https://leetcode.cn/problems/monotone-increasing-digits/

文章讲解：https://programmercarl.com/0738.%E5%8D%95%E8%B0%83%E9%80%92%E5%A2%9E%E7%9A%84%E6%95%B0%E5%AD%97.html

视频讲解：https://www.bilibili.com/video/BV1Kv4y1x7tP/

class Solution {
public:
    int monotoneIncreasingDigits(int N) {
        string strNum = to_string(N);
        // flag用来标记赋值9从哪里开始
        // 设置为这个默认值，为了防止第二个for循环在flag没有被赋值的情况下执行
        int flag = strNum.size();
        for (int i = strNum.size() - 1; i > 0; i--) {
            if (strNum[i - 1] > strNum[i] ) {
                flag = i;
                strNum[i - 1]--;
            }
        }
        for (int i = flag; i < strNum.size(); i++) {
            strNum[i] = '9';
        }
        return stoi(strNum);
    }
};