首页 > 其他 > 详细

125. Valid Palindrome

时间:2018-11-03 13:31:03      阅读:134      评论:0      收藏:0      [点我收藏+]

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 1:

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

Example 2:

Input: "race a car"
Output: false

class Solution:
    def isPalindrome(self, s):
        """
        :type s: str
        :rtype: bool
        """
        if len(s)==0:
            return True
        str = []
        for i in s:
            if i.isalnum():
                str.append(i.lower())
        for i in range(int(len(str)/2)):
            if str[i]!= str[len(str)-i-1]:
                return False
        return True

125. Valid Palindrome

原文:https://www.cnblogs.com/bernieloveslife/p/9733355.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!