LeetCode_最长公共子序列

	class Solution{
		public int longestCommonSubsequence(String text1, String text2){
			int m = text1.length(), n = text2.length();
			int[][] dp = new int[m + 1][n + 1];
			for(int i = 1; i <= m; i++){
				char c1 = text1.charAt(i - 1);		//字符串从零存储
				for(int j = 1; j <= n; j++){
					char c2 = text2.charAt(j - 1);
					if(c1 == c2){
						dp[i][j] = dp[i - 1][j - 1] + 1;	//当找到相等时，取上一个最长公共子序列+1
					}else{
						dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);  //不相等时，取横纵项最大的公共子序列值
					}
				}
			}
			int lcs = dp[m][n];
			return lcs;
		}
	}