LeetCode5 最长回文子串

public class LongestParStr {
    public static void main(String[] args) {
        System.out.println(longesdtPalindrome("babad"));
    }

    private static String longesdtPalindrome(String s) {
        boolean[][] dp = new boolean[s.length() + 1][s.length() + 1];
        int start = 0, end = 0, len = 0;
        for (int i = s.length(); i > 0; i--) {
            for (int j = i; j <= s.length(); j++) {
                if (i == j) {
                    dp[i][j] = true;
                } else {
                    if (s.charAt(i - 1) == s.charAt(j - 1)) {
                        if (i == j - 1) {
                            dp[i][j] = true;
                        } else {
                            dp[i][j] = dp[i + 1][j - 1];
                        }
                    }
                }
                if (dp[i][j] && j - i + 1 > len) {
                    len = j - i + 1;
                    start = i - 1;
                    end = j;
                }
            }
        }
        return s.substring(start, end);
    }
}