【Leetcode】Length of Last Word

标签：

题目链接：https://leetcode.com/problems/length-of-last-word/

题目：

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.

思路：

easy 不解释

算法：

[java] view plain copy

 

1. public int lengthOfLastWord(String s) {  
2.     String[] strs = s.split(" ");  
3.     if (strs.length - 1 >= 0) {  
4.         return strs[strs.length - 1].length();  
5.     } else {  
6.         return 0;  
7.     }  
8.   
9. }  

【Leetcode】Length of Last Word

标签：

原文地址：http://blog.csdn.net/yeqiuzs/article/details/51598059