leetcode Length of Last Word 1.4 难度系数1

原创于 2014-01-24 11:30:34 发布 · 3.5k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#java #leetcode

leetcode java 150 专栏收录该内容

86 篇文章

订阅专栏

本文介绍了一种方法来计算给定字符串中最后一个单词的长度。该方法通过从字符串末尾开始遍历并忽略空格，直到遇到第一个非空字符，从而确定最后一个单词的起始位置，并最终返回该单词的长度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Question:

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 int lengthOfLastWord(String s) {
        if (s == null || s.length() == 0) {
			return 0;
		}
		int len = s.length();
		int count = 0;
		for (int i = len - 1; i > -1; i--) {
			if (s.charAt(i) != ' ') {
				count++;
			}
			if(s.charAt(i)==' '&&count != 0){
				return count;
			}
		}
		return count;
    }