Longest Palindrome Substring

Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.

这道题和Palindrome partitioning 其实是一道题，都是建立二维DP table：

犯错的地方：只有length>max时才update返回string

public class Solution {
    public String longestPalindrome(String s) {
        if (s.isEmpty()) {
            return s;
        }
        int max = 1;
        String result = String.valueOf(s.charAt(0));
        int n = s.length();
        boolean[][] dict = new boolean[n][n];
        for (int i = 0; i < n; i++) {
            for (int j = i; j >= 0; j--) {
                dict[i][j] = (i-j < 2 || dict[i-1][j+1]) && (s.charAt(i) == s.charAt(j));
                if (dict[i][j] && i-j+1 > max) { <span style="color:#ff0000;">// 注意只有大于max时才update result string</span>
                    max = i-j+1;
                    result = s.substring(j, i+1);
                }
            }
        }
        return result;
    }
}

一维滚动数组：

    public String longestPalindrome(String s) {
        if (s.isEmpty()) {
            return s;
        }
        int max = 1;
        String result = String.valueOf(s.charAt(0));
        int n = s.length();
        boolean[] dist = new boolean[n];
        for (int i = 0; i < n; i++) {
            boolean[] newDist = new boolean[n];
            for (int j = i; j >= 0; j--) {
                newDist[j] = (i-j < 2 || dist[j+1]) && (s.charAt(i) == s.charAt(j));
                if (newDist[j] && i-j+1 > max) {
                    max = i-j+1;
                    result = s.substring(j, i+1);
                }
            }
            dist = newDist;
        }
        return result;
    }