- Notifications
You must be signed in to change notification settings - Fork 13
/
Copy path125-valid-palindrome.py
31 lines (28 loc) · 848 Bytes
/
125-valid-palindrome.py
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
"""
Problem Link: https://leetcode.com/problems/valid-palindrome/
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
"""
classSolution:
defisPalindrome(self, s):
"""
:type s: str
:rtype: bool
"""
low,high=0 ,len(s)-1
whilelow<high:
whilelow<highandnots[low].isalnum():
low+=1
whilelow<highandnots[high].isalnum():
high-=1
ifs[low].lower() !=s[high].lower():
returnFalse
low+=1
high-=1
returnTrue