leetcode:字符串之Length of Last Word

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;
}
测试结果:




评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值