动态规划——最长连续公共子序列

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/bless2015/article/details/87944651

    public static int longestSubstring(String A,String B){
    	
    	int f[][] = new int[A.length()+1][B.length()+1];
    	
    	for (int i = 1; i <= A.length(); i++) {
			for (int j = 1; j <= B.length(); j++) {
				if(A.charAt(i-1)==B.charAt(j-1)){
					f[i][j] = f[i-1][j-1]+1;
				}
			}
		}
    	
    	for (int i = 0; i < f.length; i++) {
			for (int j = 0; j < f[i].length; j++) {
				System.out.print(f[i][j]+" ");
			}
			System.out.println();
		}
    	return 0;
    }

longestSubstring("ABCDRAEA","CDRA");

输出：

0 0 0 0 1
0 0 0 0 0
0 1 0 0 0
0 0 2 0 0
0 0 0 3 0
0 0 0 0 4
0 0 0 0 0
0 0 0 0 1