Merge pull request #337 from zhangzw001/master

添加背包理论基础01背包-[12] 和0474.一和零 Go版本

problems/0474.一和零.md

@@ -206,7 +206,43 @@ class Solution:
 ```
 
 Go：
+```go
+func findMaxForm(strs []string, m int, n int) int {
+	// 定义数组
+	dp := make([][]int, m+1)
+	for i,_ := range dp {
+		dp[i] = make([]int, n+1 )
+	}
+	// 遍历
+	for i:=0;i<len(strs);i++ {
+		zeroNum,oneNum := 0 , 0
+		//计算0,1 个数
+		//或者直接strings.Count(strs[i],"0")
+		for _,v := range strs[i] {
+			if v == '0' {
+				zeroNum++
+			}
+		}
+		oneNum = len(strs[i])-zeroNum
+		// 从后往前 遍历背包容量
+		for j:= m ; j >= zeroNum;j-- {
+			for k:=n ; k >= oneNum;k-- {
+				// 推导公式
+				dp[j][k] = max(dp[j][k],dp[j-zeroNum][k-oneNum]+1)
+			}
+		}
+		//fmt.Println(dp)
+	}
+	return dp[m][n]
+}
 
+func max(a,b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+```
 
 
 

problems/背包理论基础01背包-1.md

@@ -273,7 +273,40 @@ Python：
 
 
 Go：
+```go
+func test_2_wei_bag_problem1(weight, value []int, bagWeight int) int {
+	// 定义dp数组
+	dp := make([][]int, len(weight))
+	for i, _ := range dp {
+		dp[i] = make([]int, bagWeight+1)
+	}
+	// 初始化
+	for j := bagWeight; j >= weight[0]; j-- {
+		dp[0][j] = dp[0][j-weight[0]] + value[0]
+	}
+	// 递推公式
+	for i := 1; i < len(weight); i++ {
+		//正序,也可以倒序
+		for  j := weight[i];j<= bagWeight ; j++ {
+			dp[i][j] = max(dp[i-1][j], dp[i-1][j-weight[i]]+value[i])
+		}		
+	}
+	return dp[len(weight)-1][bagWeight]
+}
 
+func max(a,b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+
+func main() {
+	weight := []int{1,3,4}
+	value := []int{15,20,30}
+	test_2_wei_bag_problem1(weight,value,4)
+}
+```
 
 -----------------------
 * 作者微信：[程序员Carl](https://mp.weixin.qq.com/s/b66DFkOp8OOxdZC_xLZxfw)

problems/背包理论基础01背包-2.md

@@ -219,7 +219,36 @@ Python：
 
 
 Go：
+```go
+func test_1_wei_bag_problem(weight, value []int, bagWeight int) int {
+	// 定义 and 初始化
+	dp := make([]int,bagWeight+1)
+	// 递推顺序
+	for i := 0 ;i < len(weight) ; i++ {
+		// 这里必须倒序,区别二维,因为二维dp保存了i的状态
+		for j:= bagWeight; j >= weight[i] ; j-- {
+			// 递推公式
+			dp[j] = max(dp[j], dp[j-weight[i]]+value[i])
+		}
+	}
+	//fmt.Println(dp)
+	return dp[bagWeight]
+}
 
+func max(a,b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+
+
+func main() {
+	weight := []int{1,3,4}
+	value := []int{15,20,30}
+	test_1_wei_bag_problem(weight,value,4)
+}
+```