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

[LeeCode]Length of Last Word

时间:2015-02-12 18:32:44      阅读:173      评论: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 len = strlen(s);
        if (!len)
            return 0;
        int i = len - 1;
        while (i>=0&&s[i] == ‘ ‘){
            i--;
        }
        int count = 0;
        while (i>=0&&s[i] != ‘ ‘){
            count++;
            i--;
        }
        return count;
    }
};

[LeeCode]Length of Last Word

标签:

原文地址:http://blog.csdn.net/kaitankedemao/article/details/43764279

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