valid-palindrome

最新推荐文章于 2024-06-16 05:34:45 发布

原创最新推荐文章于 2024-06-16 05:34:45 发布 · 198 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法 python #string

算法专栏收录该内容

10 篇文章

订阅专栏

本文介绍了一个用于判断字符串是否为回文的Python函数。该函数仅考虑字母数字字符，并忽略大小写差异。通过示例展示了如何识别如A man, a plan, a canal: Panama这样的复杂回文结构。

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.

def isPalindrome(S):
   if len(S) == 1 or len(S) == 0:
      return True
   i = 0
   j = len(S) - 1
   while i < j:
      while i <j and S[i].isalnum() == False:
         i += 1
      while i < j and S[j].isalnum() == False:
         j -= 1
      if i < j and S[i].lower() != S[j].lower():
         return False
      i += 1
      j -= 1
   return True
print isPalindrome("aa.. b ./..,aa")