From 9163ed6b65667e4c95a9ed2b26bd63a6a516fc9f Mon Sep 17 00:00:00 2001
From: zhangzw <zhangzw@boqii.com>
Date: Wed, 2 Jun 2021 11:49:59 +0800
Subject: [PATCH 1/2] =?UTF-8?q?=E6=B7=BB=E5=8A=A01049.=E6=9C=80=E5=90=8E?=
 =?UTF-8?q?=E4=B8=80=E5=9D=97=E7=9F=B3=E5=A4=B4=E7=9A=84=E9=87=8D=E9=87=8F?=
 =?UTF-8?q?II=20Go=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/1049.最后一块石头的重量II.md b/problems/1049.最后一块石头的重量II.md
index f74600b1..c09e476a 100644
--- a/problems/1049.最后一块石头的重量II.md
+++ b/problems/1049.最后一块石头的重量II.md
@@ -191,7 +191,33 @@ class Solution:
 ```
 
 Go：
+```go
+func lastStoneWeightII(stones []int) int {
+	// 15001 = 30 * 1000 /2 +1
+	dp := make([]int, 15001)
+	// 求target
+	sum := 0
+	for _, v := range stones {
+		sum += v
+	}
+	target := sum / 2
+	// 遍历顺序
+	for i := 0; i < len(stones); i++ {
+		for j := target; j >= stones[i]; j-- {
+			// 推导公式
+			dp[j] = max(dp[j], dp[j-stones[i]]+stones[i])
+		}
+	}
+	return sum - 2 * dp[target]
+}
 
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+```
 
 
 

From 9f84671e690208a1b40debe15b1bfa624448f348 Mon Sep 17 00:00:00 2001
From: zhangzw <zhangzw@boqii.com>
Date: Wed, 2 Jun 2021 11:51:50 +0800
Subject: [PATCH 2/2] =?UTF-8?q?=E6=B7=BB=E5=8A=A00494.=E7=9B=AE=E6=A0=87?=
 =?UTF-8?q?=E5=92=8C=20Go=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0494.目标和.md | 30 +++++++++++++++++++++++++++++-
 1 file changed, 29 insertions(+), 1 deletion(-)

diff --git a/problems/0494.目标和.md b/problems/0494.目标和.md
index c772a09d..c917ed5c 100644
--- a/problems/0494.目标和.md
+++ b/problems/0494.目标和.md
@@ -276,7 +276,35 @@ class Solution:
 ```
 
 Go：
-
+```go
+func findTargetSumWays(nums []int, target int) int {
+	sum := 0
+	for _, v := range nums {
+		sum += v
+	}
+	if target > sum {
+		return 0
+	}
+	if (sum+target)%2 == 1 {
+		return 0
+	}
+	// 计算背包大小
+	bag := (sum + target) / 2
+	// 定义dp数组
+	dp := make([]int, bag+1)
+	// 初始化
+	dp[0] = 1
+	// 遍历顺序
+	for i := 0; i < len(nums); i++ {
+		for j := bag; j >= nums[i]; j-- {
+			//推导公式
+			dp[j] += dp[j-nums[i]]
+			//fmt.Println(dp)
+		}
+	}
+	return dp[bag]
+}
+```