题目描述
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.
解题思路
本题是一个字符串相关的题。首先想到的是利用String自带的split方法,然后输出最后一个String的长度。还是需要注意的是一些特殊情况,比如有多个" "组成的字符串。
相关知识点
(1)String中查找一个字符
自己的代码
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.
解题思路
本题是一个字符串相关的题。首先想到的是利用String自带的split方法,然后输出最后一个String的长度。还是需要注意的是一些特殊情况,比如有多个" "组成的字符串。
相关知识点
(1)String中查找一个字符
char c = s.charAt(i);//查找s中的第i个字符
自己的代码
package leetcode;
public class LengthOfLastWord {
public int lengthOfLastWord(String s) {
//处理null
if(s == null) return 0;
//处理空串
if(s.length() == 0) return 0;
//处理带空格的字符串
boolean hasWorld = false;
for(int i = 0; i < s.length(); i++){
if(s.charAt(i) != ' ') {
hasWorld = true;
break;
}
}
if(!hasWorld) return 0;
String str[] = s.split(" ");
String tempStr = str[str.length-1];
return tempStr.length();
}
public static void main(String[] args) {
//String s = "hello world ";
//String s = "";
String s = " ";
LengthOfLastWord lolw = new LengthOfLastWord();
System.out.println(lolw.lengthOfLastWord(s));
}
}