int maximum69Number(int num) {
string str = to_string(num);
for (int i = 0; i < str.size(); i++)
if (str[i] - '0' == 6) {
str[i] = 9 + '0';
break;
}
int n = 0;
int size = str.size() - 1;
for (int i = 0; i < str.size(); i++) {
int tempNum = 1;
int tempSize = size;
while (size) {
tempNum *= 10;
size--;
}
n += (str[i] - '0') * tempNum;
size = --tempSize;
}
return n;
}
1323. 6 和 9 组成的最大数字
最新推荐文章于 2020-07-28 22:18:57 发布