修复背包理论基础01背包-1 GO 版本代码 Bug

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

@@ -356,9 +356,13 @@ func test_2_wei_bag_problem1(weight, value []int, bagweight int) int {
 	// 递推公式
 	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])
-		}		
+	    for j := 0; j <= bagweight; j++ {
+	        if j < weight[i] {
+	            dp[i][j] = dp[i-1][j]
+	        } else {
+	            dp[i][j] = max(dp[i-1][j], dp[i-1][j-weight[i]]+value[i])
+	        }
+	    }		
 	}
 	return dp[len(weight)-1][bagweight]
 }