diff --git a/problems/1035.不相交的线.md b/problems/1035.不相交的线.md
index a10fd381..8795a77d 100644
--- a/problems/1035.不相交的线.md
+++ b/problems/1035.不相交的线.md
@@ -109,6 +109,41 @@ class Solution:
         return dp[-1][-1]
 ```
 
+
+Golang:
+
+```go
+
+func maxUncrossedLines(A []int, B []int) int {
+	m, n := len(A), len(B)
+	dp := make([][]int, m+1)
+    for i := range dp {
+        dp[i] = make([]int, n+1)
+    }
+
+	for i := 1; i <= len(A); i++ {
+		for j := 1; j <= len(B); j++ {
+			if (A[i - 1] == B[j - 1]) {
+				dp[i][j] = dp[i - 1][j - 1] + 1;
+			} else {
+				dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
+			}
+		}
+	}
+	return dp[m][n];
+
+}
+
+func max(a, b int) int {
+    if a > b {
+        return a
+    }
+    return b
+}
+```
+
+
+
 JavaScript：
 
 ```javascript