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.

class Solution 
{
public:
    int lengthOfLastWord(const char *s) 
	{
        <span style="white-space:pre">	</span>int pre = 0;
		int end = 0;
		bool flag  = true;
		int i=0;
		while(s[i]!='\0')
		{
			if(flag == true && s[i]!=' ')
			{
				pre = i;
				end = i+1;
				flag = false;
			}
			else if(flag == false &&(s[i]==' ' || s[i+1] == '\0'))
			{
			    if(s[i] == ' ')
				    end = i;
				else if(s[i+1] == '\0')
				    end = i+1;
				flag = true;
			}
			i++;
		}
		return end-pre;
    }
};

LeetCode---Length of Last Word

原文：http://blog.csdn.net/shaya118/article/details/42641067