leetcode:字符串之Length of Last Word

最新推荐文章于 2024-02-24 16:21:39 发布

what_lei

最新推荐文章于 2024-02-24 16:21:39 发布

阅读量692

点赞数

分类专栏： leetcode 文章标签： C++ leetcode 字符串

本文链接：https://blog.csdn.net/what_lei/article/details/52185315

版权

leetcode 专栏收录该内容

28 篇文章 0 订阅

订阅专栏

leetcode:字符串之Length of Last Word

题目：

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.

c++实现：

#include <iostream>
#include <algorithm>

using namespace std;
//使用STL
//int lengthOfLastWord(const char *s)
//{
//	const string str(s);
//    auto first = find_if(str.rbegin(), str.rend(), ::isalpha);
//    auto last = find_if_not(first, str.rend(), ::isalpha);
//    return distance(first, last);
//}
//顺序扫描
int lengthOfLastWord(const char *s)
{
	int len = 0;
    while (*s) 
	{
		if (*s++ != ' ')
            ++len;
        else if (*s && *s != ' ')
            len = 0;
     }
     return len;
}
int main()
{
	const char *s="Hello World";
	int length;
	length=lengthOfLastWord(s);
	cout<<"Length of Last Word: "<<length<<endl;

	return 0;
}

测试结果：