[LeetCode] 058. Length of Last Word

• Problem (Easy)
• Approach 1: (My Solution)
  • Idea
  • Solution
  • Complexity

Problem (Easy)

058. 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.

Example:

• Input: “Hello World”
• Output: 5

Approach 1: (My Solution)

Idea

Simple one-line solution.

Solution

class Solution1:
    def lengthOfLastWord(self, s):
        """
        :type s: str
        :rtype: int
        """
        return len(s.strip().split(' ')[-1])

Complexity

• Time: $O(n)$
• Space: $O(n)$

KF