代码随想录算法训练营 day 31 | Leetcode 56 738

Leetcode 合并区间

class Solution {
public:
    static bool cmp(vector<int> &a, vector<int> &b){
        return a[0] < b[0];
    }
    vector<vector<int>> merge(vector<vector<int>>& intervals) {
        if(intervals.size() <= 1) {return intervals;}
        sort(intervals.begin(), intervals.end(), cmp);
        vector<vector<int>> result;
        int left = intervals[0][0];
        int right = intervals[0][1];

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

Leetcode 738 单调递增的数字

class Solution {
public:
    int monotoneIncreasingDigits(int n) {
        string s = to_string(n);
        int flag = s.size();
        for(int i = s.size() - 1; i > 0; i--){
            if(s[i - 1] > s[i]){
                flag = i;
                s[i - 1]--;
            }
        }
        for(int i = flag; i < s.size(); i++){
            s[i] = '9';
        }
        return stoi(s);
    }
};