首页 > 其他 > 详细

LeetCode | Length of Last Word

时间:2014-03-23 09:43:00      阅读:252      评论:0      收藏: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.

分析

用了java自带的trim就很简单了。

代码

public class LengthOfLastWord {
	public int lengthOfLastWord(String s) {
		s = s.trim();
		int p = -1;
		for (int i = 0; i < s.length(); ++i) {
			if (s.charAt(i) == ‘ ‘) {
				p = i;
			}
		}
		return s.length() - p - 1;
	}
}

LeetCode | Length of Last Word,布布扣,bubuko.com

LeetCode | Length of Last Word

原文:http://blog.csdn.net/perfect8886/article/details/21779429

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!