算法打卡6

class Solution {
    bool isNumeric(char c) {
        return c >= '0' && c <= '9';
    }

public:
    bool areNumbersAscending(string s) {
       int pre = -100000;
       int sum = 0;
       s += " ";
       for(int i=0;i < s.size();++i)
       {
         if(isNumeric( s[i] ))
         {
             sum = sum *10 + s[i] - '0';//这里改为 sum *11 + s[i] - '0'运行速度会更快

         }
         else
         {
             if(sum == 0)
             {
                 continue;
             }
             if(sum > pre)
             {
                 pre = sum;
                 sum = 0;
             }
             else
             {
                 return false;
             }
         }
       }
       return true;
    }
};