[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

.
分析：
简单的一道题，没有任何技巧。注意一下边界等小问题即可。

代码：

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