動的計画法とナップサック問題の基礎をアニメーションで - Qiita

def knapsack02(x, W, V): for i in range(len(W)): for j in range(x + 1): if j < W[i]: dp_table[i + 1][j] = dp_table[i][j] else: dp_table[i + 1][j] = max(dp_table[i][j], dp_table[i + 1][j - W[i]] + V[i]) movie.append(draw02(dp_table, i, j)) return dp_table[len(W)][x] def draw02(dp_table, i, j): image = [] if i == 0 and j == 0: im_text = plt.text(0, weight_limit * 1.1, "Start!", size=20) image.append