[leetcode]32 Length of Last Word

最新推荐文章于 2020-06-04 04:41:26 发布

BeLeaderOfMyLife

最新推荐文章于 2020-06-04 04:41:26 发布

阅读量393

点赞数

分类专栏： leetcode算法文章标签： length last world leetcode

本文链接：https://blog.csdn.net/shawjan/article/details/44702435

版权

leetcode算法专栏收录该内容

54 篇文章 0 订阅

订阅专栏

题目链接：https://leetcode.com/problems/length-of-last-word/
Runtimes：4ms

1、问题

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.

2、分析

简单的问题，注意边界的判断

3、小结

陷阱：1、空字符串判断；2、i边界的判断

4、实现

class Solution {
public:
    int lengthOfLastWord(const char *s) {
        if('\0' == s[0])
            return 0;
        int i = 0;
        while(s[i] != '\0')
            ++i;
        --i;
        while(i >= 0 && s[i] == ' ')
            --i;
        int sta = i;
        while(i >= 0 && s[i] != ' ')
            --i;
        return sta - i;
    }
};