双指针遍历
class Solution {
public:
bool areNumbersAscending(string s) {
int len = s.length();
int mmax = 0;
bool flag = false;
for (int i = 0; i < len; i ++ ) {
if (isdigit(s[i])) {
int j = i;
int res = 0, num = 0;
while (j < len && isdigit(s[j])) { //双指针遍历
res = num * 10;
num = s[j] - '0';
res += num;
j++;
}
if (res > mmax) mmax = res;
else return false;
i = j;
}
}
return true;
}
};