Solve : Longest Palindromic Substring

Author: printjin-gmailcom

longest-palindromic-substring/printjin-gmailcom.py

@@ -0,0 +1,13 @@
+class Solution:
+    def longestPalindrome(self, s):
+        def expand(left, right):
+            while left >= 0 and right < len(s) and s[left] == s[right]:
+                left -= 1
+                right += 1
+            return s[left + 1:right]
+        res = ""
+        for i in range(len(s)):
+            odd = expand(i, i)
+            even = expand(i, i + 1)
+            res = max(res, odd, even, key=len)
+        return res