algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 03:34:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

更新 1035.不相交的线.md 代码

Browse Source 
原代码缩进、命名、空格不规范
This commit is contained in:
zhicheng lee
2022-09-19 21:02:56 +08:00
committed by GitHub
parent 444064eae3
commit c1497b6e6e
1 changed files with 19 additions and 16 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
problems/1035.不相交的线.md
View File

@ -76,19 +76,22 @@ public:
Java： Java：
```java ```java
class Solution { class Solution {
public int maxUncrossedLines(int[] A, int[] B) { public int maxUncrossedLines(int[] nums1, int[] nums2) {
int [][] dp = new int[A.length+1][B.length+1]; int len1 = nums1.length;
for(int i=1;i<=A.length;i++) { int len2 = nums2.length;
for(int j=1;j<=B.length;j++) { int[][] dp = new int[len1 + 1][len2 + 1];
if (A[i-1]==B[j-1]) {
for (int i = 1; i <= len1; i++) {
for (int j = 1; j <= len2; j++) {
if (nums1[i - 1] == nums2[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[A.length][B.length];
return dp[len1][len2];
} }
} }
``` ```