重点就是字符串与数字之间的转换。
注意头文件#include <string>
int maxinum(int num) {
string s;
s = to_string(num);
for (int i = 0; i < s.length(); i++) {
if (s[i] == '6') {
s[i] = '9';
break;
}
}
return stoi(s);
}
重点就是字符串与数字之间的转换。
注意头文件#include <string>
int maxinum(int num) {
string s;
s = to_string(num);
for (int i = 0; i < s.length(); i++) {
if (s[i] == '6') {
s[i] = '9';
break;
}
}
return stoi(s);
}
重点就是字符串与数字之间的转换。 注意头文件#include int maxinum(int num) { s...
问题： 方法：很简单的一道题，只需要修改从左到右第一个6为9即可，因为高位对大小影响更大。 有问题随时沟通 具体代...
The maximum number of apps for free development profiles ...
Spot the maximum number of Odd Ones Out in 60 seconds in ...
Given a binary array, find the maximum number of consecut...
Given a binary array, find the maximum number of consecut...
Given a binary array, find the maximum number of consecut...
Given a binary array, find the maximum number of consecut...
Given a binary array, find the maximum number of consecut...
Given a binary array, find the maximum number of consecut...
本文标题：5315. Maximum 69 Number
本文链接：https://www.haomeiwen.com/subject/wdejzctx.html
网友评论