leetcode 647：回文子串的个数

    public int longestPalindrome(String s) {
    	int n = s.length();
    	int count = 0;
    	boolean[][] dp = new boolean[n][n];
    	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]);
					if(dp[i][j])
						count++;
				}
				else {
					dp[i][j] = false;
				}
			}
		}
    	for (int i = 0; i < dp.length; i++) {
			System.out.println(Arrays.toString(dp[i]));
		}
    	return count;
    }