def longestPalindrome()

in contributor/anhyobin/optimize-serverless-application-on-aws/test.py [0:0]

• 12 lines of code
• 6 McCabe index (conditional complexity)

    def longestPalindrome(self, s: str) -> str:
        if len(s) <= 1:
            return s
        i,l=0,0
        for j in range(len(s)):
            if s[j-l: j+1] == s[j-l: j+1][::-1]:
                i, l = j-l, l+1
                print(s[i: i+l])
            elif j-l > 0 and s[j-l-1: j+1] == s[j-l-1: j+1][::-1]:
                i, l = j-l-1, l+2
                print(s[i: i+l])
        return s[i: i+l]