Description

Given a string s consisting of words and spaces, return the length of the last word in the string. A word is a maximal substring consisting of non-space characters only.

Examples

Input:s = "Hello World"
Output:5
Explanation:

The string splits into words ['Hello', 'World']. The last word 'World' contains 5 characters: W-o-r-l-d.

Input:s = " fly me to the moon "
Output:4
Explanation:

Ignoring leading/trailing spaces, the words are ['fly', 'me', 'to', 'the', 'moon']. The last word 'moon' has 4 characters.

Input:a
Output:1
Explanation:

The string contains only one word 'a' with length 1. This demonstrates the minimum case where the entire string is just a single character word.

Constraints

  • 1 ≤ s.length ≤ 10⁴
  • s consists of only English letters and spaces ' '.
  • There will be at least one word in s.

Ready to solve this problem?

Practice solo or challenge other developers in a real-time coding battle!