2496. Maximum Value of a String in an Array

發表於 | 分類於

problem

solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
class Solution {
public:
    int maximumValue(vector<string>& strs) {
        int ret = -1;
        int count = 0;
        for(string str:strs)
        {
            bool leadZeros = true;
            bool alpha = false;
            for(char c:str){
                if(c>=97 && c<= 122 ){
                    alpha = true;
                    break;
                }
                else if(c=='0' && leadZeros) continue;
                else{
                    leadZeros = false;
                    count =  10*count + (c-'0');
                }
                
            }
            if(alpha) ret = max(ret, (int)str.size());
            else ret = max(ret, count);
            count = 0; 
        }
        return ret;
        
    }
};

analysis

  • time complexity O(nm)
  • space complexity O(1)