Edit Distance Palindrome 和lc上最小edit distance类似 高频题
Page 1 of 1
Edit Distance Palindrome 和lc上最小edit distance类似 高频题
可能会问你怎么推倒方程
public static int findMinimumDistance(String s){
int[][] dp = new int[s.length()][s.length()];
for(int i=0;i<s.length();i++)
for(int j=0;j<s.length();j++){
if(i>=j)dp[i][j]=0;
}
for (int i = s.length(); i >= 0; i--) {
for (int j = i+1; j < s.length(); j++) {
if(s.charAt(i) == s.charAt(j)){
dp[i][j] = dp[i+1][j-1];
}else{
dp[i][j] = Math.min(Math.min(dp[i+1][j],dp[i][j-1]), dp[i+1][j-1])+1;
}
}
}
return dp[0][s.length()-1];
}
public static int findMinimumDistance(String s){
int[][] dp = new int[s.length()][s.length()];
for(int i=0;i<s.length();i++)
for(int j=0;j<s.length();j++){
if(i>=j)dp[i][j]=0;
}
for (int i = s.length(); i >= 0; i--) {
for (int j = i+1; j < s.length(); j++) {
if(s.charAt(i) == s.charAt(j)){
dp[i][j] = dp[i+1][j-1];
}else{
dp[i][j] = Math.min(Math.min(dp[i+1][j],dp[i][j-1]), dp[i+1][j-1])+1;
}
}
}
return dp[0][s.length()-1];
}
Page 1 of 1
Permissions in this forum:
You cannot reply to topics in this forum
|
|