leetcode--Length of Last Word

weixin_30577801

于 2019-08-20 23:29:37 发布

阅读量134

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/averillzheng/p/3774511.html

本文介绍了一种计算给定字符串中最后一个单词长度的方法。通过遍历字符串从末尾开始，忽略空格并计数非空格字符，直到遇到下一个空格为止。此方法适用于包含大小写字母和空格的字符串。

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 Solution {
    public int lengthOfLastWord(String s) {
        int length = s.length();
		int lastWordLength = 0;
		if(length > 0){
			int lastIndex = length - 1;		
			while(lastIndex > -1 && s.charAt(lastIndex) == 32)
				--lastIndex;
			if(lastIndex > -1){
			    while(lastIndex > -1 && s.charAt(lastIndex) != 32){
				    --lastIndex;
				    ++lastWordLength;
			    }
			}
		}
		return lastWordLength;    
    }
}

转载于:https://www.cnblogs.com/averillzheng/p/3774511.html