Leetcode September Day15

Problem

Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word (last word means the last appearing word if we loop from left to right) in the string.

If the last word does not exist, return 0.

Note: A word is defined as a maximal substring consisting of non-space characters only.

Example -
"""
Input: "Hello World"
Output: 5
"""
Approach - This is a fairly straightforward question. We iterate over the string , find the last word and return it's length.
Solution -

class Solution:
    def lengthOfLastWord(self, s: str) -> int:
        return len(s.rstrip().split(" ")[-1]) if s else 0

Here, rstrip() removes the trailing spaces from a string. split(" ") splits the string by " " (spaces) and returns an array.