lc58.最后一个单词的长度

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18

class Solution {
public:
    int lengthOfLastWord(string s) {
        int n = s.size();
        int idx = n - 1, ans = 0;

        while(s[idx] == ' '){
            idx --;
        }

        while(idx >= 0 && s[idx] != ' '){
            idx --;
            ans ++;
        }

        return ans;
    }
};

 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
30
31
32
33

class Solution {
public:
    vector<string> split(string& s){
        vector<string> ans;
        int n = s.size();
        for(int i = 0, j = 0; j < n;){
            if(s[j] == ' '){
                if(i == j){
                    i++, j++;
                }else{
                    ans.push_back(s.substr(i, j - i));
                    j ++;
                    i = j;
                }
            }else{
                j++;
            }
            
            if(j == n){
                if(i != j){
                    ans.push_back(s.substr(i, j - i));
                }
            }
        }

        return ans;
    }
    int lengthOfLastWord(string s) {
        vector<string> ans = split(s);

        return ans.back().size(); 
    }
};