-
Notifications
You must be signed in to change notification settings - Fork 0
/
125.py
65 lines (49 loc) · 1.86 KB
/
125.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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
'''
A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric characters include letters and numbers.
Given a string s, return true if it is a palindrome, or false otherwise.
Example 1:
Input: s = "A man, a plan, a canal: Panama"
Output: true
Explanation: "amanaplanacanalpanama" is a palindrome.
Example 2:
Input: s = "race a car"
Output: false
Explanation: "raceacar" is not a palindrome.
Example 3:
Input: s = " "
Output: true
Explanation: s is an empty string "" after removing non-alphanumeric characters.
Since an empty string reads the same forward and backward, it is a palindrome.
Constraints:
1 <= s.length <= 2 * 105
s consists only of printable ASCII characters.
'''
# https://leetcode.com/problems/valid-palindrome/
import unittest
def is_palindrome(s):
s = ''.join(e for e in s if e.isalnum()).lower()
return s == s[::-1]
class TestValidPalindrome(unittest.TestCase):
def test_example1(self):
s = "A man, a plan, a canal: Panama"
expected = True
# Call the function that solves the problem
result = is_palindrome(s)
# Assert that the result matches the expected output
self.assertEqual(result, expected)
def test_example2(self):
s = "race a car"
expected = False
# Call the function that solves the problem
result = is_palindrome(s)
# Assert that the result matches the expected output
self.assertEqual(result, expected)
def test_example3(self):
s = " "
expected = True
# Call the function that solves the problem
result = is_palindrome(s)
# Assert that the result matches the expected output
self.assertEqual(result, expected)
if __name__ == '__main__':
unittest.main()