标签：
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) { const char *p = s; int len = 0; p = s; while(*p != ‘\0‘) { if(*p == ‘ ‘) { if(*(p+1) != ‘ ‘ && *(p+1) != ‘\0‘) len = 0; } else len ++; p++; } return len; } };
[LeetCode] Length of Last Word
标签：
原文地址：http://www.cnblogs.com/diegodu/p/4317979.html
