From 9b52a5070c4a2e6c38023302b2c541dc59a94098 Mon Sep 17 00:00:00 2001
From: nmydt <62681228+nmydt@users.noreply.github.com>
Date: Wed, 19 May 2021 21:13:30 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=201035.=E4=B8=8D=E7=9B=B8?=
 =?UTF-8?q?=E4=BA=A4=E7=9A=84=E7=BA=BF=20Java=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/1035.不相交的线.md | 19 ++++++++++++++++++-
 1 file changed, 18 insertions(+), 1 deletion(-)

diff --git a/problems/1035.不相交的线.md b/problems/1035.不相交的线.md
index 6f2b6646..660b1e27 100644
--- a/problems/1035.不相交的线.md
+++ b/problems/1035.不相交的线.md
@@ -73,7 +73,24 @@ public:
 
 
 Java：
-
+  ```java
+  class Solution {
+    public int maxUncrossedLines(int[] A, int[] B) {
+		int [][] dp = new int[A.length+1][B.length+1];
+		for(int i=1;i<=A.length;i++) {
+			for(int j=1;j<=B.length;j++) {
+				if (A[i-1]==B[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];
+	}
+}
+  ```
 
 Python：