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 n=strlen(s);
 5         int i=0;
 6         int cnt=0;
 7         //i=n;
 8         while(s[n-1]==' ')
 9             n--;
10             
11         for(i=n-1;i>=0;i--)
12         {
13             if(s[i]!=' ')
14                 cnt++;
15             else
16                 break;
17                 
18         }
19         return cnt;
20     }
21     
22 };

 

posted on 2015-05-12 07:49  黄瓜小肥皂  阅读(128)  评论(0编辑  收藏  举报