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.
String
class Solution { public: int lengthOfLastWord(const char *s) { if(s==NULL) return 0; int len=0; const char *start = s; while(*s!=‘\0‘){ if(*s==‘ ‘){ int le=s-start; if(le!=0) len=le; start=s+1; s++; }else s++; } int le=s-start; if(le!=0) len=le; return len; } };
Length of Last Word输出最后单词的字母个数
原文：http://www.cnblogs.com/li303491/p/4106676.html