728x90
반응형
using Slicing
leetcode-125
+ 정규식 사용
import re
import collections
class Solution:
def isPalindrome(self, s: str) -> bool:
s = s.lower()
s = re.sub('[^a-z0-9]','',s)
return s == s[::-1] # reverse
Result : 46ms Memory: 15.7mb
반응형
'One step' 카테고리의 다른 글
LeetCode - Time complexity 시간 복잡도 (0) | 2023.03.02 |
---|---|
[leetcode-819] Most Common Word (0) | 2023.03.02 |
[leetcode-937] Reorder_Data_in_LogFile (0) | 2023.03.01 |
[leetcode-344] ReverseString (0) | 2023.02.27 |
[leetcode-125] Palindrome (0) | 2023.02.26 |