题解 | #在二叉树中找到两个节点的最近公共祖先#

import java.util.*;

public class Solution { public int getLongestPalindrome(String A, int n) { // write code here int maxLen =1, start = 0; int[][] dp = new int[n][n]; for(int j=0;j<n;j++){ for(int i=0;i<=j;i++){ if(i==j){ dp[i][j] = 1; }else{ if( A.charAt(i)==A.charAt(j)){ if(i == j-1){ dp[i][j] = 1;
}else{ dp[i][j] = dp[i+1][j-1]; } } } //get max len and start index if(dp[i][j] == 1 && j-i+1> maxLen){ maxLen = j-i+1; start = i; } } }

    return maxLen;
}

}