您的位置:首页 > 其它

Leetcode Problem.58—Length of Last Word

2015-06-03 15:18 323 查看
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
.

My C++ solution!

int lengthOfLastWord(string s) 
    {
        int len=s.length();
        int pos=0;
        int count=0;
        if(len==0)
          return 0;
        while(pos<len)
		{
			if(s[pos]!=32)
			{
				count++;
			    pos++;
			}
			else
			{
				while(pos<len&&s[pos]==32)
					pos++;
				 if(pos<len)
				 {
					 count=1;
				     pos++;
				 }
			}
		}
       return count;
    }
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: