Leetcode5：Longest Palindromic Substring@Python

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

Example:

Input: "babad"

Output: "bab"

Note: "aba" is also a valid answer.

Example:

Input: "cbbd"

Output: "bb"


动态规划法：以"ababae"为例：

class Solution(object):
    def longestPalindrome(self, s):
        """
        :type s: str
        :rtype: str
        """
        sLength=len(s)
        begin=0
        length=0
        table=[]
        for i in range(sLength):
            tem=[]
            for j in range(sLength):
                tem.append(0)
            table.append(tem)
            
        for i in range(sLength):
            table[i][i]=1

        for i in range(sLength-1):
            if s[i]==s[i+1]:
                table[i][i+1]=1
                begin=i
                length=1
            
        for tem in range(1,sLength):
            for i in range(sLength-tem):
                j=i+tem
                if (s[i]==s[j] and table[i+1][j-1])==1:
                    table[i][j]=1
                    length=tem
                    begin=i

        return s[begin:begin+length+1]