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 len = strlen(s); if(len == 0) return 0; int i = len-1; int LastEnd = len-1; int LastStart = 0; while(s[i]==‘ ‘&& i>=0) { i--; } LastEnd = i; if(LastEnd == -1) return 0; while(s[i]!=‘ ‘&& i>=0) { i--; } LastStart = (i+1); return LastEnd-LastStart+1; } };
[LeetCode] Length of Last Word,布布扣,bubuko.com
[LeetCode] Length of Last Word
原文：http://www.cnblogs.com/Xylophone/p/3848374.html