码迷,mamicode.com
首页 > 其他好文 > 详细

LeetCode:Length of Last Word

时间:2014-07-19 22:36:30      阅读:149      评论:0      收藏:0      [点我收藏+]

标签:style   blog   color   strong   io   for   

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  };

LeetCode:Length of Last Word,布布扣,bubuko.com

LeetCode:Length of Last Word

标签:style   blog   color   strong   io   for   

原文地址:http://www.cnblogs.com/levicode/p/3855139.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!