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.
此题有毒,踩的是赞的的三倍,感觉没啥实际意义,很简单,代码如下:
class Solution {
public int lengthOfLastWord(String s) {
int count = 0;
int index = s.length() - 1;
while(index >= 0 && s.charAt(index) == ' ')
{
index--;
}
while(index >= 0 && s.charAt(index) != ' ') {
count ++;
index--;
}
return count;
}
}
我很奇怪,为什么这个也ac了,这是我第一编写的,后来发现完全用不到forloop循环,可删除forloop循环就一直报错, really dk y - -!
class Solution {
public int lengthOfLastWord(String s) {
String[] array = s.split(" ");
int count = 0;
for(int i = 0 ; i < array.length ; i++){
char[] lastword = array[array.length - 1].toCharArray();
count = lastword.length;
}
return count;
}
}