LeetCode 5: Longest Palindromic Substring

Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.

Example 1:

Input: "babad"
Output: "bab"
Note: "aba" is also a valid answer.

Example 2:

Input: "cbbd"
Output: "bb"

The common way ($O(n^2)$): start from i, i-th is the center of Palindromic Substring or the most left element of symetric substring, and extend the substring, respectively.
The simple way ($O(n)$): ith is the end of Palindromic Substring, extend the substring whose lenth is over the current max_ length. And this has two condition: One for odd length substring and another for even substring.

1. Common way ($O(n^2)$)

class Solution:
    def longestPalindrome(self, s: 'str') -> 'str':
        def doo(l, r, max_, max_s):
            def ispalin(l, r):
                if l == -1 or r == len(s) or s[l] != s[r]:
                    return False
                return True
            while True:
                if ispalin(l, r):
                    l -= 1
                    r += 1
                else:
                    if r - l - 1 > max_:
                        max_ = r - l - 1
                        max_s = s[l+1:r]
                    break
            return max_, max_s
        max_ = 0
        max_s = ''
        for i in range(len(s)):
            l, r = i-1, i+1
            max_, max_s = doo(l, r, max_, max_s)
            l, r = i, i+1
            max_, max_s = doo(l, r, max_, max_s)
        return max_s

2. Simple way

class Solution:
    def longestPalindrome(self, s: 'str') -> 'str':
        max_ = 1
        start = 0
        for i in range(1, len(s)):
            if i-max_ >= 0 and s[i-max_:i+1] == s[i-max_:i+1][::-1]:
                start = i-max_
                max_ += 1
            if i-max_ - 1 >= 0 and s[i-max_-1:i+1] == s[i-max_-1:i+1][::-1]:
                start = i-max_-1
                max_ += 2
        return s[start:start+max_]