[leetcode-125] Palindrome + Slicing

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