LeetCode------58. Length of Last Word(字符串中最后一个单词的长度)

nameix

于 2016-11-04 22:37:13 发布

阅读量354

点赞数

分类专栏：字符串 LeetCode

本文链接：https://blog.csdn.net/nameix/article/details/53039833

版权

LeetCode 同时被 2 个专栏收录

56 篇文章 0 订阅

订阅专栏

字符串

4 篇文章 0 订阅

订阅专栏

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.

Subscribe to see which companies asked this question

// “ ”-----“ab ”(ab算最后一个单词)-----“ab cdf”(不能简单的split(" ");)

//2.非单词的出现

//3. 输入“ ”会出现越界异常(trim操作)

<pre name="code" class="java">public class Solution {
   public int lengthOfLastWord(String s) {
		if (s != null && !s.trim().equals("")) {
			String[] arr = s.trim().split(" ");
			int length = arr[arr.length - 1].length();
			return length;
		}
		return 0;
	}
}