美文网首页
Leetcode-125Valid Palindrome

Leetcode-125Valid Palindrome

作者: LdpcII | 来源:发表于2018-04-13 21:56 被阅读0次

    125. Valid Palindrome

    Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.

    For example,
    "A man, a plan, a canal: Panama" is a palindrome.
    "race a car" is not a palindrome.

    Note:
    Have you consider that the string might be empty? This is a good question to ask during an interview.

    For the purpose of this problem, we define empty string as valid palindrome.

    My Solution:

    import re
    class Solution:
        def isPalindrome(self, s):
            """
            :type s: str
            :rtype: bool
            """
            return ''.join(re.compile(r"[A-Za-z0-9]").findall(s)).lower() == ''.join(re.compile(r"[A-Za-z0-9]").findall(s)).lower()[::-1]
    

    Reference:

    import string
    
    class Solution:
        def isPalindrome(self, s):
            """
            :type s: str
            :rtype: bool
            """
            remove_punctuation = str.maketrans('', '', string.punctuation)
            clean_s = s.translate(remove_punctuation).lower().replace(' ', '')
            return clean_s[::-1] == clean_s
    
    

    相关文章

      网友评论

          本文标题:Leetcode-125Valid Palindrome

          本文链接:https://www.haomeiwen.com/subject/wywhkftx.html