Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word (last word means the last appearing word if we loop from left to right) in the string.
If the last word does not exist, return 0.
Note: A word is defined as a maximal substring consisting of non-space characters only.
Example:
Input: "Hello World" Output: 5
class Solution:
def lengthOfLastWord(self, s: str) -> int:
last_word_length = 0
meet_word = False
for i in range(len(s) - 1, -1, -1):
ch = ord(s[i])
if ch >= 65 and ch <= 122:
meet_word = True
last_word_length += 1
elif meet_word:
break
return last_word_lengthclass Solution {
public int lengthOfLastWord(String s) {
int n = s.length();
int lastWordLength = 0;
boolean meetWord = false;
for (int i = n - 1; i >= 0; --i) {
char ch = s.charAt(i);
if (ch >= 'A' && ch <= 'z') {
meetWord = true;
++lastWordLength;
} else if (meetWord) {
break;
}
}
return lastWordLength;
}
}