leetcode:求最后一个单词长度

/****************************************************************************************************
Question :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.
******************************************************************************************************/
#include<iostream>
#include<cstring>
const int Maxletter = 128 ;

int LengthOfLastWord(const char *s) 
{
    int length = strlen(s);
    //std::cout<< length << std::endl;
    int index = length - 1;//换算为数组下标 
    int count = 0;
    if (NULL == s ||!length) //字符串如果为空或者没有字符 返回0
         return 0;
    //std::cout<< *(s + index) << std::endl; //指向最后一个字符 i love，则是e，length为6  
    while (*(s + index) == ' ')//从最后一个非空格的字符开始往前遍历
         index--;
    while (*(s+index)!=' '&&index>=0)   //从后往前，直到遇到空格
         count++,index--;
	return count;
 }

int main()
{
	int countletters;
    char str[Maxletter+1];
	std::cin.get(str,Maxletter);
	countletters = LengthOfLastWord(str);
	std::cout << countletters ; 
}