LeetCode 58. Length of Last Word

Description

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:
1
2
Input: "Hello World"
Output: 5

求给出的字符串中最后一个单词的长度。

Solution

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
func lengthOfLastWord(s string) int {
    length := 0
    for i := len(s) - 1; i >= 0; i-- {
        if s[i] == ' ' {
            // if there are spaces at last, they'll be skip
            if length > 0 {
                break
            }
        } else {
            // there are only alphabets and space
            // so it's alphabets now
            // we don't need to check if s[i] between 'a' to 'z' or 'A' to 'Z'
            length++
        }
    }

    return length
}