【leetcode】(python) 125. Valid Palindrome有效回文

125. Valid Palindrome Easy

Description

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

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

Example

• Example 1

Input: "A man, a plan, a canal: Panama"
Output: true

• Example 2:

Input: "race a car"
Output: false

题意

给定一个字符串，判断它是否是回文，只考虑字母数字字符并忽略大小写。

解题思路

将给定原字符串转换成只包含数字和小写字母的list,用python特性来判断。

code

class Solution:
    def isPalindrome(self, s: str) -> bool:
        if s == []:
            return True
        new_s = [i for i in s.lower() if i.isalnum()]
        return new_s == new_s[::-1]