-
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.
쉬어가는 문제였다..
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode charactersimport re class Solution: def lengthOfLastWord(self, s: str) -> int: if s == "": return 0 for alp in s.split(" ")[::-1]: if alp != "": return len(alp) return 0 위지원데이터와 관련된 일을 모두 좋아합니다
'2020년 > 코테' 카테고리의 다른 글
[코테 연습] Sort the Matrix Diagonally (0) 2020.09.16 [코테 연습] 구명 보트 (0) 2020.09.15 [코테 연습] House Robber (0) 2020.09.15 [코테 연습] 가장 큰수 (0) 2020.09.15 [코테 연습] Bulls and Cows (0) 2020.09.14