题目来源
题目描述
题目解析
很简单,直接动态规划即可
#include<bits/stdc++.h>
using namespace std;
int process(std::string str){
if(str.empty()){
return 0;
}
std::vector<int> dp(str.size(), 0);
dp[0] = str[0] >= '0' && str[0] <= '9' ? 1 : 0;
int max = dp[0];
for (int i = 1; i < str.size(); ++i) {
if(isalpha(str[i])){
dp[i] = 0;
continue;
}
if(str[i] - '0' >= str[i - 1] - '0' ){
dp[i] = dp[i - 1] + 1;
}else{
dp[i] = 1;
}
max = std::max(max, dp[i]);
}
return max;
}
int main(int argc, char **argv)
{
std::cout << process("abc2234019A334bc");
}