leetcode 最长回文子字符串 II

    public String longestPalindrome(String s) {
    	int n = s.length();
    	String ret = "";
    	boolean[][] dp = new boolean[n][n];
    	int start = 0;
    	int end = 0;
    	for (int i = n-1; i >= 0; i--) {
			dp[i][i] = true;
			for (int j = i; j < n; j++) {
				if(s.charAt(i) == s.charAt(j)) {
					dp[i][j] = true&&(j-i<3||dp[i+1][j-1]);
				}
				else {
					dp[i][j] = false;
				}
				if(dp[i][j] && j-i+1>=end-start) {
					start = i;
					end = j+1;
				}
	
			}
		}
    	ret = s.substring(start, end);
    	for (int i = 0; i < dp.length; i++) {
			System.out.println(Arrays.toString(dp[i]));
		}
    	return ret;
    }