1 解题思想
这道题就是找到最后一个词的长度,每个次之间就是用空格分隔。。
所以我们就找到最后一个空格,然后计数就可以了
2 原题
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.
For example,
Given s = “Hello World”,
return 5.
3 AC解
public class Solution {
public int lengthOfLastWord(String s) {
char[] chars=s.toCharArray();
int i=s.length()-1;
int count=0;
while(i>=0 && chars[i]==' '){
i--;
}
while(i>=0 && chars[i--]!=' '){
count++;
}
return count;
}
}