Leetcode Problem.58—Length of Last Word

来源:互联网 发布:随机森林算法入门 编辑:程序博客网 时间:2024/06/10 16:57

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.

My C++ solution!

   int lengthOfLastWord(string s)     {        int len=s.length();        int pos=0;        int count=0;        if(len==0)          return 0;        while(pos<len){if(s[pos]!=32){count++;    pos++;}else{while(pos<len&&s[pos]==32)pos++; if(pos<len) { count=1;     pos++; }}}       return count;    }


0 0
原创粉丝点击