結果 : implement 0 1 knapsack problem using dynamic programming in java