Remove duplicative code.

Author: coopers

Diff for: python/0005-longest-palindromic-substring.py

@@ -1,25 +1,13 @@
 class Solution:
     def longestPalindrome(self, s: str) -> str:
         res = ""
-        resLen = 0
 
         for i in range(len(s)):
-            # odd length
-            l, r = i, i
-            while l >= 0 and r < len(s) and s[l] == s[r]:
-                if (r - l + 1) > resLen:
-                    res = s[l : r + 1]
-                    resLen = r - l + 1
-                l -= 1
-                r += 1
+            for l, r in ((i,i), (i,i+1)): # odd and even lengths
+                while l >= 0 and r < len(s) and s[l] == s[r]:
+                    if (r - l + 1) > len(res):
+                        res = s[l:r + 1]
+                    l -= 1
+                    r += 1
 
-            # even length
-            l, r = i, i + 1
-            while l >= 0 and r < len(s) and s[l] == s[r]:
-                if (r - l + 1) > resLen:
-                    res = s[l : r + 1]
-                    resLen = r - l + 1
-                l -= 1
-                r += 1
-
-        return res
+        return res