結果 : how to solve 0 1 knapsack problem using dynamic programming