本文共 575 字，大约阅读时间需要 1 分钟。

问题：

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.

参考别人的代码：

写代码之前一定要想好思路

代码：

class Solution {public:    int lengthOfLastWord(const char *s) {	int n = strlen(s) - 1;	while(n>=0 && s[n] == ' ')		n--;	int  i = 0;	for(; n>=0 && s[n] != ' '; n--, i++);	return i;	}};

转载地址：http://qktsi.baihongyu.com/