[leetcode] Length of Last Word

Length of Last Word

  Total Accepted: 32811  Total Submissions: 113876 My 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();
	}

}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值