[leetcode] 738. Monotone Increasing Digits

题目：

Given a non-negative integer N, find the largest number that is less than or equal to N with monotone increasing digits.

(Recall that an integer has monotone increasing digits if and only if each pair of adjacent digits x and y satisfy x <= y.)

Example 1:

Input: N = 10
Output: 9

Example 2:

Input: N = 1234
Output: 1234

Example 3:

Input: N = 332
Output: 299

Note: N is an integer in the range [0, 10^9].

代码：

#include<algorithm>
class Solution {
public:
    int monotoneIncreasingDigits(int N) {
        int flag = 0;
        int num[10];
        int i = 0;
        while(N){
            num[i++] = N % 10;
            N /= 10;
        }
        int res = 0;
        int same = i-1;
        int cnt = i;
        for(i -= 1; i >= 1; i--){
            if(!flag && num[i] < num[i-1]){
                same = i-1;
            }else if(!flag && num[i] > num[i-1]){
                for(int j = i; j < same; j++){
                    num[j]=9;
                }
                num[same]--;
                flag = 1;
            }
            else if(!flag && num[i] == num[i-1]){
                continue;
            }
            else if(flag){
                num[i] = 9;
            }
        }
        if(flag) num[0] = 9;
        for(int j = cnt-1; j >= 0; j--)
            res = res * 10 + num[j];
        return res;
    }
};

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