LintCode:最长回文子串

LintCode:最长回文子串
需要引入一个二维数组M[i]来记录字符串与反转后的字符串的重复状态，以字符串abcdzdcab 为例，M[i]如下图所示：

然后只需要找到M[i]上最长的连续1的个数就是最长回文字符串的长度，记住位置，再在原来的字符串上截取一可以了。

class Solution:
    # @param {string} s input string
    # @return {string} the longest palindromic substring
    def longestPalindrome(self, s):
        # Write your code here
        if len(s) == 0:
            return 0
        n = len(s)
        r = s[::-1]
        L = [[0 for i in range(n + 1)] for i in range(n + 1)]
        M = [[0 for i in range(n + 1)] for i in range(n + 1)]
        max_len = 0
        loc = 0

        for i in range(1, n+1):
            for j in range(1, n+1):
                if s[i-1] == r[j-1]:
                    L[i][j] = 1
                if L[i][j] == 1:
                    M[i][j] = M[i-1][j-1] + 1
            if max(M[i]) > max_len:
                max_len = max(M[i])
                loc = i

        return s[loc-max_len:loc]