求两个字符串的最长公共子序列

package com.cjh.dp;

public class dp3 {
	public static void main(String[] args) {
		//求两个字符串的最长公共子序列
		int l = method("abcxyz","abxyz");
		System.out.println(l);
	}

	private static int method(String string1, String string2) {
		// TODO Auto-generated method stub
		int[][] dp = new int[string1.length() + 1][string2.length() + 1];
		for (int i = 1; i < string1.length() + 1; i++) {
			for (int j = 1; j < string2.length() + 1; j++) {
				if (string1.charAt(i - 1) == string2.charAt(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]);
				}
			}
		}
		return dp[string1.length()][string2.length()];
	}
}