[W4]

valid-palindrome solution
DaleStudy · Sep 5, 2024 · 5740518 · 5740518
1 parent 6ef3bee
commit 5740518
Show file tree

Hide file tree

Showing 2 changed files with 18 additions and 0 deletions.
diff --git a/two-sum/sun912.py b/two-sum/sun912.py
diff --git a/valid-palindrome/sun912.py b/valid-palindrome/sun912.py
@@ -0,0 +1,18 @@
+class Solution:
+    def isPalindrome(self, s: str) -> bool:
+        str = list(s.lower())
+        chars = []
+        for c in str:
+            if (ord(c) >= ord("a") and ord(c) <= ord("z")) or (ord(c) >= ord("0") and ord(c) <= ord("9")):
+                chars.append(c)
+
+        for i in range(len(chars)//2):
+
+            if len(c)%2 == 0:
+                if chars[i] != chars[-(i+1)]:
+                    return False
+            else:
+                if chars[i] != chars[-(i+1)]:
+                    return False
+
+        return True