반응형
Length of Last Word
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.
Example 1:
Input: s = "Hello World"
Output: 5
Explanation: The last word is "World" with length 5.
Example 2:
Input: s = " fly me to the moon "
Output: 4
Explanation: The last word is "moon" with length 4.
Example 3:
Input: s = "luffy is still joyboy"
Output: 6
Explanation: The last word is "joyboy" with length 6.
Constraints:
1 <= s.length <= 104sconsists of only English letters and spaces' '.- There will be at least one word in
s.
class Solution:
def lengthOfLastWord(self, s: str) -> int:
return len(s.split()[-1])
이 문제는 크게 고민할 필요 없던 문제였다. split()을 하게 되면 default 상황이면 공백을 모두 제외하고 공백을 기준으로 split하기 때문에 split 메서드를 잘 활용해보자.
반응형
'알고리즘 스터디' 카테고리의 다른 글
| [Leetcode/파이썬] 322. Coin Change (0) | 2026.03.15 |
|---|---|
| [Leetcode/파이썬] 392. Is Subsequence (0) | 2026.03.15 |
| [Leetcode/파이썬] 222. Count Complete Tree Nodes (0) | 2026.03.07 |
| [Leetcode/파이썬] 133. Clone Graph (0) | 2026.03.07 |
| [Leetcode/파이썬] 202. Happy Number (0) | 2026.03.07 |