码迷,mamicode.com
首页 > 其他好文 > 详细

[leetcode] Length of Last Word

时间:2015-02-01 16:12:14      阅读:148      评论:0      收藏:0      [点我收藏+]

标签:

Length of Last Word

 Total Accepted: 32811 Total Submissions: 113876My Submissions

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.

package com.wyt.leetcodeOJ;

/**
 * @author wangyitao
 * @Date 2015-01-23
 * @version 1.0
 * @Description 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.
 *
 */
public class LengthofLastWord {

	public static void main(String[] args) {
		System.out.println(lengthOfLastWord("Hello orld "));
	}

	public static int lengthOfLastWord(String s) {
		if(s == null || s.length() == 0) {
			return 0;
		}
		s = s.trim();
		for (int i = s.length() - 1; i >=0; i--) {
			if (s.charAt(i) == ' ') {
				return s.length() - i - 1;
			}
		}
		return s.length();
	}

}


[leetcode] Length of Last Word

标签:

原文地址:http://blog.csdn.net/intmain_rocking/article/details/43371513

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!