LeetCode:Length of Last Word

最新推荐文章于 2018-07-17 23:20:16 发布

weixin_30439031

最新推荐文章于 2018-07-17 23:20:16 发布

阅读量57

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/levicode/p/3855139.html

本文提供了一个C++函数，用于计算给定字符串中最后一个单词的长度。该函数通过遍历字符串并计数直到遇到空格为止的字符数量来实现。

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.

 1 class Solution{
 2 public:
 3      int lengthOfLastWord(const char *s){
 4          int count=0,last=0;
 5          while(*s)
 6          {
 7              if(*s++!=' ')
 8              {
 9                  count++;
10              }
11              else if(count>0)
12              {
13                  last=count;
14                  count=0;
15              }
16          }
17          return (count>0)?count:last;
18      }
19  };