class Solution {
public:
vector<vector<int>>merge(vector<vector<int>>& intervals){sort(intervals.begin(), intervals.end(),[](vector<int>& a, vector<int>& b){return a[0]< b[0];});int l = intervals[0][0];int r = intervals[0][1];
vector<vector<int>> result;for(int i =1; i < intervals.size(); i++){// 合并if(intervals[i][0]<= r){
r =max(r, intervals[i][1]);}elseif(r < intervals[i][0]){
result.push_back({l,r});
l = intervals[i][0];
r = intervals[i][1];}}
result.push_back({l,r});return result;}};
class Solution {
public:intmonotoneIncreasingDigits(int n){
string num =to_string(n);int flag = num.size();//flag以后的用9填充for(int i = num.size()-1; i >0; i--){if(num[i]< num[i-1]){
num[i-1]--;
flag = i;}}int result =0;for(int i =0; i < flag; i++){
result *=10;
result += num[i]-'0';}for(int i = flag; i < num.size(); i++){
result *=10;
result +=9;}return result;}};