58. Length of Last Word

tanlichun789

于 2018-04-11 15:21:10 发布

阅读量104

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.csdn.net/qq_34609108/article/details/79897230

LeetCode 专栏收录该内容

59 篇文章

订阅专栏

本文介绍了一个C++程序，该程序能够计算给定字符串中最后一个单词的长度。通过遍历字符串并忽略尾部空格，程序进一步计算最后一个单词的字符数量。

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

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.

Example:

Input: "Hello World"
Output: 5

class Solution {
public:
	int lengthOfLastWord(string s) {
		int len = s.length();
		int ans = 0;
		if (!len) return 0;
		int index = len-1;
		while (index >= 0 && s[index] == ' ') index--;
		while (index >= 0 && s[index] != ' ')
		{
			index--;
			ans++;
		}
		return ans;
	}
};