首页 > 其他 > 详细

LeetCode Length of Last Word

时间:2017-05-05 22:32:07      阅读:223      评论:0      收藏:0      [点我收藏+]

1. 题目


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.


2.解决方式


class Solution {
public:
    int lengthOfLastWord(const char *s) {
        int len = strlen(s);
        int result = 0;
        
        while(s[len-1]==‘ ‘) len--;
        
        for(int i = len - 1; i >= 0; --i){
            if(s[i] != ‘ ‘){
                ++result;
            }else{
                    break;
            }
        }
        return result;
        }
        
    
};

思路:还是比較easy的,就是要先把后面的‘ ’都先干掉。

http://www.waitingfy.com/archives/1645

LeetCode Length of Last Word

原文:http://www.cnblogs.com/liguangsunls/p/6815018.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!