Merge pull request #1652 from zhicheng-lee/zhicheng-lee-patch-12

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

problems/1035.不相交的线.md

@@ -74,24 +74,27 @@ public:
 
 
 Java：
-  ```java
+```java
   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]) {
+
-					dp[i][j]=dp[i-1][j-1]+1;
+        for (int i = 1; i <= len1; i++) {
-				}
+            for (int j = 1; j <= len2; j++) {
-				else {
+                if (nums1[i - 1] == nums2[j - 1]) {
-					dp[i][j]=Math.max(dp[i-1][j], dp[i][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[A.length][B.length];
+            }
-	}
+        }
+
+        return dp[len1][len2];
+    }
 }
-  ```
+```
 
 Python：
 ```python