-
Notifications
You must be signed in to change notification settings - Fork 0
/
LeetCode1143.java
35 lines (32 loc) · 1.04 KB
/
LeetCode1143.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
/**
* @ProjectName: LeetCode
* @Author: XinyuLiu
* @Description:
*/
public class LeetCode1143 {
//1.动态规划 二维dp
public int longestCommonSubsequence(String text1, String text2) {
int len1 = text1.length(), len2 = text2.length();
int[][] dp = new int[len1 + 1][len2 + 1];
for (int i = 0; i <= len1; i++) {
dp[i][0] = 0;
}
for (int j = 0; j <= len2; j++) {
dp[0][j] = 0;
}
// 这里转成char[]方便判断
char[] charArray1 = text1.toCharArray();
char[] charArray2 = text2.toCharArray();
for (int i = 1; i < len1 + 1; i++) {
for (int j = 1; j < len2 + 1; j++) {
// 这里注意i,j的值,要减1对应字符串的位置
if (charArray1[i - 1] == charArray2[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[len1][len2];
}
}