class Solution {
public:
int monotoneIncreasingDigits(int n) {
string s = to_string(n);
int lastCur = -1;
for (int i = s.length() - 2; i >= 0; i--) {
if (s[i] > s[i + 1]) {
s[i + 1] = '9';
s[i] = s[i] - 1;
lastCur = i;
}
}
if (lastCur != -1) {
for (int i = lastCur + 1; i < s.length(); i++) {
s[i] = '9';
}
}
return atoi(s.c_str());
}
};
LeetCode738.单调递增的数字
于 2024-06-29 10:26:59 首次发布