221.最大正方形
相似题目: 1277. 统计全为 1 的正方形子矩阵
class Solution {
public int maximalSquare(char[][] matrix) {
int maxSide = 0;
if (matrix == null || matrix.length == 0 || matrix[0].length == 0) {
return maxSide;
}
int rows = matrix.length, columns = matrix[0].length;
int[][] dp = new int[rows][columns];
for (int i = 0; i < rows; i++) {
for (int j = 0; j < columns; j++) {
if (matrix[i][j] == '1') {
if (i == 0 || j == 0) {
dp[i][j] = 1;
} else {
dp[i][j] = Math.min(Math.min(dp[i - 1][j], dp[i][j - 1]), dp[i - 1][j - 1]) + 1;
}
maxSide = Math.max(maxSide, dp[i][j]);
}
}
}
int maxSquare = maxSide * maxSide;
return maxSquare;
}
}
516. 最长回文子序列
1.需要两个指针去字符串中判断
2.定义dp[i][j] 为i…j之间最长回文,i = j 时,dp[i][j] = 1;
3.如果s.charAt(i) == s.charAt(j),也就是说两头的字符是一样的,他们可以和中间的最长回文子序列构成一个更长的回文子序列,即dp[i][j]=dp[i+1][j-1]+2
4.如果s.charAt(i) != s.charAt(j),说明i和j指向的字符是不相等的,我们可以截取,要么去掉i指向的字符,要么去掉j指向的字符,然后取最大值,即dp[i][j] = Math.max(dp[i][j-1], dp[i+1][j])
5.关键是放在一个二维表中理解
class Solution {
public int longestPalindromeSubseq(String s) {
int length = s.length();
int dp[][] = new int [length][length];
for(int i=length-1;i>=0;--i){
dp[i][i] = 1;
for(int j=i+1;j<length;++j){
if(s.charAt(i) == s.charAt(j)){
dp[i][j] = dp[i+1][j-1] +2;
}else{
dp[i][j] = Math.max(dp[i][j-1],dp[i+1][j]);
}
}
}
return dp[0][length-1];
}
}