題目描述
Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.
If the last word does not exist, return 0.
Note: A word is defined as a character sequence consists of non-space characters only.
Example:
Input: "Hello World"
Output: 5
注意拯钻，不管最后多少個(gè) ' '，都不算最后一個(gè)word椭迎，最后一個(gè) word 是非 ' '
Input: "Hello World "
Output: 5
Input: "Hello World "
Output: 5
題目思路
- 思路一蝎抽、
class Solution {
public:
int lengthOfLastWord(string s) {
int len = s.size();
int result = 0;
bool flag = false;
for(int i=len-1; i >= 0; i--){
if(s[i] == ' '){
if(flag == true){
break;
}
continue;
}
flag = true;
result += 1;
}
return result;
}
};
