LeetCode-Easy刷题(12) Length of Last Word

当以乐

于 2017-11-28 18:13:58 发布

阅读量177

点赞数

CC 4.0 BY-SA版权

分类专栏：数据结构和算法文章标签： LeetCode 刷题面试 Java

本文链接：https://blog.csdn.net/sqh201030412/article/details/78657810

数据结构和算法专栏收录该内容

34 篇文章

订阅专栏

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.

Example:

Input: "Hello World"
Output: 5

查找空格后最后一个单词的长度,如最后一个单词不存在返回0

   //基本编码
    public static int lengthOfLastWord(String s) {

        if(s ==null || s.length()<1){
            return 0;
        }
        int index1 = s.length()-1;
        while(index1>=0 && s.charAt(index1)==' '){
            index1--;//到非空格位置终止
        }
        int index2 = index1;
        while(index2>=0 && s.charAt(index2)!=' '){
            index2--;//到空格位置终止
        }
        return index1 -index2;
    }