首页 > 其他 > 详细

leetcode:length of last world

时间:2016-03-18 17:20:41      阅读:219      评论: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.

2、

  

public class Solution {
    /**
     * @param s A string
     * @return the length of last word
     */
    public int lengthOfLastWord(String s) {
       int length = 0;
       //转化为数组
            char[] chars = s.toCharArray();
            for (int i = s.length() - 1; i >= 0; i--) {
                if (length == 0) {
                    if (chars[i] == ‘ ‘) {
                        continue;
                    } else {
                        length++;
                    }
                } else {
                    if (chars[i] == ‘ ‘) {
                        //停止
                        break;
                    } else {
                        length++;
                    }
                }
            }

            return length;
    }
}

 

leetcode:length of last world

原文:http://www.cnblogs.com/zilanghuo/p/5292773.html

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