結果 : explain dynamic programming solution to 0 1 knapsack problem