125. Valid Palindrome(判断忽略标点的字符串是否回文,加个正则,与上一题解法一样)

Posted 张乐乐章

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了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.

 

 1 class Solution:
 2     def isPalindrome(self, s):
 3         """
 4         :type s: str
 5         :rtype: bool
 6         """
 7         if s==‘‘:
 8             return True
 9         import re
10         x = re.sub(\W,‘‘,s).lower()
11         if x==‘‘:
12             return True
13         if(len(x)%2!=0):#
14             for i in range(int(len(x)/2)+1):
15                 if(x[i]!=x[len(x)-i-1]):
16                     return False
17         else:
18             for i in range(int(len(x)/2)+1):
19                 if(x[i]!=x[len(x)-i-1]):
20                     return False
21         return True
22         

 

以上是关于125. Valid Palindrome(判断忽略标点的字符串是否回文,加个正则,与上一题解法一样)的主要内容,如果未能解决你的问题,请参考以下文章

125. Valid Palindrome

125. Valid Palindrome(判断忽略标点的字符串是否回文,加个正则,与上一题解法一样)

125. Valid Palindrome

125. Valid Palindrome

LeetCode 125. Valid Palindrome

125. Valid Palindrome(js)