leetcode

0 class Solution {

1 public:

2 int monotoneIncreasingDigits(int n) const {

3 string num = to_string(n);

4 const int m = size(num);

5 int stop = m - 1;

6

7 for (int i = m - 1; i > 0; i--) {

8 if (num[i] >= num[i - 1]) continue;

9 stop = i - 1;

10 num[i - 1]--;

11 }

12

13 for (int i = stop + 1; i < m; i++)

14 num[i] = '9';

15

16 return stoi(num);

17 }

18 };