我这个第三题为啥是0啊，本地都是对的 def knapsack(K, N, wide, value): opt = [[0] * (K+1) for i in range(N+1)] max_val = 0 for i in range(1, N+1): for j in range(K+1): # can load if wide[i-1] <= j: opt[i][j] = max(value[i-1] + opt[i-1][j-wide[i-1]], opt[i-1][j]) if opt[i][j] > max_val: max_val = opt[i][j] else: opt[i][j] = 0 print(max_val)