Fix the bug in chapterDynamicProgramming, Unbounded and Bounded Knapsack Problem

[Problem]
对于完全背包问题，由于物品数为sum(W/w[i]) (对数优化后为sum(log(W/w[i]))), 所以算法复杂度为：
O(W*sum(W/w[i])) (O(W*sum(log(W/w[i]))))
对于多重背包同理。
So fix the problem.

Signed-off-by: jonnyhsy <jonnyhsy@foxmail.com>