58. Length of Last Word

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.

Solution:

after skipping inceptive spaces backwards(or trim), find first space backwards

Code1:

class Solution {
    public int lengthOfLastWord(String s) {
        if(s == null || s.length() == 0) return 0;
 
        // skip space backwards
        int back_start = s.length() - 1;
        while(back_start >= 0 && s.charAt(back_start) == ' ') back_start--;
        
        // find first first space backwards from back_start
        int space_pos = -1;
        for(int i = back_start; i >= 0; i--) {
            if(s.charAt(i) ==' ') {
                space_pos = i;
                break;
            }
        }
        return start - space_pos;
    }
}

Code2:

class Solution {
    public int lengthOfLastWord(String s) {
        int len = 0, tail = s.length() - 1;
        while (tail >= 0 && s.charAt(tail) == ' ') tail--;
        while (tail >= 0 && s.charAt(tail) != ' ') {
            len++;
            tail--;
        }
        return len;
    }
}

Code3:

class Solution {
    public int lengthOfLastWord(String s) {
        return s.trim().length() - s.trim().lastIndexOf(" ") - 1;
    }
}
最后编辑于
©著作权归作者所有,转载或内容合作请联系作者
【社区内容提示】社区部分内容疑似由AI辅助生成,浏览时请结合常识与多方信息审慎甄别。
平台声明:文章内容(如有图片或视频亦包括在内)由作者上传并发布,文章内容仅代表作者本人观点,简书系信息发布平台,仅提供信息存储服务。

推荐阅读更多精彩内容

友情链接更多精彩内容