标签:
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