LeetCode#5 Longest Palindromic Substring

class Solution:
    # @param {string} s
    # @return {string}
    def longestPalindrome(self, s):
        lenS = len(s)
        maxLen = 0
        maxStr = ""
        for i in range(0,lenS):
            l = r = i
            
            while l>=0 and r<lenS and s[l] == s[r]:
                l-=1
                r+=1
            
            l+=1
            r-=1
            if r - l >= maxLen:
                maxLen = r - l
                maxStr = s[l:r+1]
                
            l = i
            r = i+1
            
            while l>=0 and r<lenS and s[l] == s[r]:
                l-=1
                r+=1
            l+=1
            r-=1
            if r - l >= maxLen:
                maxLen = r-l
                maxStr = s[l:r+1]
                
        return maxStr