码迷,mamicode.com
首页 > 其他好文 > 详细

leetcode[58]Length of Last Word

时间:2015-02-09 15:40:23      阅读:114      评论: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.

class Solution {
public:
    int lengthOfLastWord(const char *s) {
        int res=0; 
        if(NULL==s)return res;
        int len=strlen(s);
        while(s[len-1]== )len--;
        for(int i=len-1;i>=0;i--)
        {
            if(s[i]!= )
               res++;
            else break;
        }
        return res;
    }
};

 

leetcode[58]Length of Last Word

标签:

原文地址:http://www.cnblogs.com/Vae98Scilence/p/4281530.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!