Symmetric Tree

目录

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.

1
2
3
4
5
6
7
8
9
10
//开始length(),trim忘加
public class Solution {
public int lengthOfLastWord(String s) {
if(s==null||"".equals(s)||s.trim().equals("")){
return 0;
}
String[] r=s.split(" ");
return r[r.length-1].length();
}
}