From de57c317f96bf49b20dd3dd80ee6317d59e67671 Mon Sep 17 00:00:00 2001
From: markwang <www.wang61@qq.com>
Date: Thu, 15 Aug 2024 16:39:04 +0800
Subject: [PATCH] =?UTF-8?q?1049.=E6=9C=80=E5=90=8E=E4=B8=80=E5=9D=97?=
 =?UTF-8?q?=E7=9F=B3=E5=A4=B4=E7=9A=84=E9=87=8D=E9=87=8FII=E5=A2=9E?=
 =?UTF-8?q?=E5=8A=A0Go=E4=BA=8C=E7=BB=B4dp=E8=A7=A3=E6=B3=95?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../1049.最后一块石头的重量II.md     | 39 +++++++++++++++++++
 1 file changed, 39 insertions(+)

diff --git a/problems/1049.最后一块石头的重量II.md b/problems/1049.最后一块石头的重量II.md
index 4f2cc9e3..b40ed114 100644
--- a/problems/1049.最后一块石头的重量II.md
+++ b/problems/1049.最后一块石头的重量II.md
@@ -313,6 +313,8 @@ class Solution:
 
 ```
 ### Go：
+
+一维dp
 ```go
 func lastStoneWeightII(stones []int) int {
 	// 15001 = 30 * 1000 /2 +1
@@ -341,6 +343,43 @@ func max(a, b int) int {
 }
 ```
 
+二维dp
+```go
+func lastStoneWeightII(stones []int) int {
+    sum := 0
+    for _, val := range stones {
+        sum += val
+    }
+    target := sum / 2
+	
+    dp := make([][]int, len(stones))
+    for i := range dp {
+        dp[i] = make([]int, target + 1)
+    }
+    for j := stones[0]; j <= target; j++ {
+        dp[0][j] = stones[0]
+    }
+	
+    for i := 1; i < len(stones); i++ {
+        for j := 0; j <= target; j++ {
+            if stones[i] > j {
+                dp[i][j] = dp[i-1][j]
+            } else {
+                dp[i][j] = max(dp[i-1][j], dp[i-1][j-stones[i]] + stones[i])
+            }
+        }
+    }
+    return (sum - dp[len(stones)-1][target]) - dp[len(stones)-1][target]
+}
+
+func max(x, y int) int {
+    if x > y {
+        return x
+    }
+    return y
+}
+```
+
 ### JavaScript:
 
 ```javascript