和大神们学习每天一题(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.

功能测试用例：“   Hello World   ”, "Hello World" 

特殊输入测试用例： “” ， “         ”， NULL

class Solution 
{
public:
	int lengthOfLastWord(const char *s) 
	{
		if (*s == '\0'||s==NULL)//如果输入为空字符串或者输入指针指向空，则返回0
			return 0;
		int nForLen = 0, nLatLen = 0;//定义两个长度，分别为前一个字长度和当前字长度
		while (*s != '\0')//遍历字符串
		{
			if (*s == ' ')//判断当前指针指向符号为空格
			{
				if (nLatLen)
				{
					nForLen = nLatLen;
					nLatLen = 0;
				}
			}
			else if ((*s >= 'a'&&*s <= 'z') || (*s >= 'A'&&*s <= 'Z'))//判断当前指针指向符号是否是大小写字母
			{
				nLatLen++;
			}
			else//异常输入则返回空
			{
				return NULL;
			}
			s++;
		}
		return (nLatLen == 0 ? nForLen : nLatLen);
	}
};