leetcode 题解: Length of Last Word

leetcode：

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.

说明：给定一个字符串，返回最后一个word的长度

       1）字符串后面可以有空格，所以要去尾部空格

       2）可能不含word

 1 class Solution {
 2 public:
 3     int lengthOfLastWord(const char *s) {
 4         int len=strlen(s);
 5         while(s[len-1]==‘ ‘) len--;
 6         if(len<0) return 0;
 7         int i=0;
 8         for(;s[len-1]&&s[len-1]!=‘ ‘;i++,len--);
 9         return i;
10     }
11 };

View Code

leetcode 题解: Length of Last Word,布布扣,bubuko.com

leetcode 题解: Length of Last Word

原文：http://www.cnblogs.com/zhoutaotao/p/3801600.html