Leetcode 58. Length of Last Word

来源:互联网 发布:四三九九网络 编辑:程序博客网 时间:2024/06/04 17:53

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.

思路极其简单的一道题。把代码写优雅简洁,另外第一次 length 忘了初始化导致出错。

class Solution {public:    int lengthOfLastWord(string s) {        int length=0;        int i=s.size()-1;        while(i>=0 && s[i]==' ')               --i;        if(i==-1)            return 0;        while(i>=0 && s[i--]!=' ')            ++length;        return length;    }};
0 0