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

LeetCode:Length of Last Word

时间:2016-05-07 11:23:24      阅读:154      评论:0      收藏:0      [点我收藏+]

标签:

Length of Last Word


Total Accepted: 92400 Total Submissions: 315131 Difficulty: Easy

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.

Subscribe to see which companies asked this question

Hide Tags
 String



















c++ code:

class Solution {
public:
    int lengthOfLastWord(string s) {
        int tail = s.size() - 1;
        int cnt=0;
        
        while(tail>=0 && ' ' == s[tail]) tail--;
        while(tail>=0 && s[tail]!=' ') {
            cnt++;
            tail--;
        }
        return cnt;
    }
};


LeetCode:Length of Last Word

标签:

原文地址:http://blog.csdn.net/itismelzp/article/details/51331453

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