首页 > 其他 > 详细

[LeetCode] Length of Last Word

时间:2015-03-06 14:05:50      阅读:235      评论:0      收藏:0      [点我收藏+]

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.

 

Hide Tags
 String
 
 
思路:遇到空格并且下一个字符不是空格或者‘\0’ ,len 清零,否则++;

 

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

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!