題目描述

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",

題解：

1 public class Solution {
2     public int lengthOfLastWord(String s) {
3         String[] str = s.split(" ");
4         if(str.length == 0) return 0;
5         return str[str.length - 1].length();
6     }
7 }

[leetcode] length-of-last-word