Backups/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

auto commit

Browse Source
This commit is contained in:
CyC2018 2019-11-30 17:31:04 +08:00
parent 5a4a46ed04
commit bd9a97cdb9
2 changed files with 22 additions and 22 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
docs/notes/Leetcode 题解 - 动态规划.md
View File

@ -633,20 +633,20 @@ public int wiggleMaxLength(int[] nums) {
[Leetcode](https://leetcode.com/problems/longest-common-subsequence/) / [力扣](https://leetcode-cn.com/problems/longest-common-subsequence/) [Leetcode](https://leetcode.com/problems/longest-common-subsequence/) / [力扣](https://leetcode-cn.com/problems/longest-common-subsequence/)
```java ```java
public int lengthOfLCS(int[] nums1, int[] nums2) { public int longestCommonSubsequence(String text1, String text2) {
int n1 = nums1.length, n2 = nums2.length; int n1 = text1.length(), n2 = text2.length();
int[][] dp = new int[n1 + 1][n2 + 1]; int[][] dp = new int[n1 + 1][n2 + 1];
for (int i = 1; i <= n1; i++) { for (int i = 1; i <= n1; i++) {
for (int j = 1; j <= n2; j++) { for (int j = 1; j <= n2; j++) {
if (nums1[i - 1] == nums2[j - 1]) { if (text1.charAt(i - 1) == text2.charAt(j - 1)) {
dp[i][j] = dp[i - 1][j - 1] + 1; dp[i][j] = dp[i - 1][j - 1] + 1;
} else { } else {
dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]); dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
}
} }
} }
return dp[n1][n2];
} }
return dp[n1][n2];
}
``` ```
# 0-1 背包 # 0-1 背包

22
notes/Leetcode 题解 - 动态规划.md
View File

@ -633,20 +633,20 @@ public int wiggleMaxLength(int[] nums) {
[Leetcode](https://leetcode.com/problems/longest-common-subsequence/) / [力扣](https://leetcode-cn.com/problems/longest-common-subsequence/) [Leetcode](https://leetcode.com/problems/longest-common-subsequence/) / [力扣](https://leetcode-cn.com/problems/longest-common-subsequence/)
```java ```java
public int lengthOfLCS(int[] nums1, int[] nums2) { public int longestCommonSubsequence(String text1, String text2) {
int n1 = nums1.length, n2 = nums2.length; int n1 = text1.length(), n2 = text2.length();
int[][] dp = new int[n1 + 1][n2 + 1]; int[][] dp = new int[n1 + 1][n2 + 1];
for (int i = 1; i <= n1; i++) { for (int i = 1; i <= n1; i++) {
for (int j = 1; j <= n2; j++) { for (int j = 1; j <= n2; j++) {
if (nums1[i - 1] == nums2[j - 1]) { if (text1.charAt(i - 1) == text2.charAt(j - 1)) {
dp[i][j] = dp[i - 1][j - 1] + 1; dp[i][j] = dp[i - 1][j - 1] + 1;
} else { } else {
dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]); dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
}
} }
} }
return dp[n1][n2];
} }
return dp[n1][n2];
}
``` ```
# 0-1 背包 # 0-1 背包