-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathValid_Palindrome.py
More file actions
41 lines (25 loc) · 863 Bytes
/
Valid_Palindrome.py
File metadata and controls
41 lines (25 loc) · 863 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
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
Constraints:
s consists only of printable ASCII characters.
class Solution:
def isPalindrome(self, s: str) -> bool:
if s == '':
return True
string = []
for char in s:
if char.isalnum() and char!= ' ':
string.append(char.lower())
print(string)
return string == string[::-1]
import re
class Solution:
def isPalindrome(self, s: str) -> bool:
s = "".join(re.findall("[a-zA-Z0-9]", s)).lower()
return s == s[::-1]