动态规划 最长公共子串问题 记录一下

import java.util.*;

/**
* Created by dd on 2016/8/22.
*/
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
while (scan.hasNext()) {
String str = scan.next();
show(str);
}
}
public static void show(String str) {
char[] c1 = str.toCharArray();
StringBuffer sb = new StringBuffer(str);
String newStr = sb.reverse().toString();
char[] c2 = newStr.toCharArray();
int n = str.length();
int[][] dp = new int[n+1][n+1];
for(int i=1;i<n+1;i++){
for(int j=1;j<n+1;j++){
if(c1[i-1]==c2[j-1]){
dp[i][j]=dp[i-1][j-1]+1;
}else{
dp[i][j]=Math.max(dp[i-1][j],dp[i][j-1]);
}
}
}
System.out.println(str.length()-dp

);
}
}