Leetcode刷题记录——125. 验证回文串

先将字符串只保留字母数字
然后设置首尾指针 向中间聚合

class Solution:
    def isPalindrome(self, s: str) -> bool:
        length = len(s)
        if length <= 1:
            return True
        reslist = s.split(' ')
        res = ''
        s = s.lower()
        for letter in s:
            if letter.isdigit() or letter.isalpha():
                res += letter

        start = 0
        end = len(res) - 1
        while start <= end:
            if res[start] != res[end]:
                return False
            start += 1
            end -= 1
        return True