leetcode_58. Length of Last Word

来源:互联网 发布:淘宝网在线客服 编辑:程序博客网 时间:2024/06/11 01:03

题目: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(string s) {        if(s == "") return 0;        int last  = 0;        int i = 0;        for(i; i < s.size()-1; ++i){            if(s[i] == ' ' && s[i+1] != ' '){                last = 0;            }            else if(s[i] != ' '){                ++last;            }        }        if(s[s.size()-1] != ' '){            last++;        }        return last;    }};


0 0
原创粉丝点击