PROBLEM DESCRIPTION
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.
Please make sure you try to solve this problem without using library functions. Make sure you only traverse the string once.
SOLUTION
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
public class Solution {
public int lengthOfLastWord(final String A) {
int length = 0;
int i = A.length()-1;
while(i>=0 && A.charAt(i) == ' '){
i--;
}
while(i>=0 && A.charAt(i) != ' '){
length++;
i--;
}
return length;
}
}