renamed napsack.go to Knapsack.go, changed using struct to using weight, value slice, changed printing all to printing max profit.

Author: n9te9

dynamic-programming/knapsack.go

@@ -0,0 +1,49 @@
+// Knapsack Problem
+// https://www.geeksforgeeks.org/0-1-knapsack-problem-dp-10/
+package Knapsack
+
+// package main
+
+import (
+	"math"
+)
+
+func max(a, b int) int {
+	return int(math.Max(float64(a), float64(b)))
+}
+
+// solve knapsack problem
+// return maxProfit
+func solve(maxWeight int, weights, values []int) int {
+	n := len(weights)
+	m := maxWeight
+	// create dp data structure
+	dp := make([][]int, n+1)
+	for i := range dp {
+		dp[i] = make([]int, m+1)
+	}
+	for i := 0; i < len(weights); i++ {
+		for j := 0; j <= maxWeight; j++ {
+			if weights[i] > j {
+				dp[i+1][j] = dp[i][j]
+			} else {
+				dp[i+1][j] = max(dp[i][j-weights[i]]+values[i], dp[i][j])
+			}
+		}
+	}
+	return dp[n][m]
+}
+
+/*
+func main() {
+	maxWeight := 50
+	values := []int{
+		60, 100, 120,
+	}
+	weights := []int{
+		10, 20, 30,
+	}
+	maxProfit := solve(maxWeight, weights, values)
+	fmt.Println(maxProfit)
+}
+*/