【正文】 if points_x[i].x points_y[j].x:34 (points_x[i])35 if points_x[i].y = points_y[j].y:36 j += 137 i += 138 else:39 (points_y[j])40 if points_y[j].y = points_x[i].y:41 i += 142 j += 143 while i x_len:44 if points_x[i].x merged_points[1].x and points_x[i].y merged_points[1].y:45 (points_x[i])46 i += 147 while j y_len:48 if points_y[j].x merged_points[1].x and points_y[j].y merged_points[1].y:49 (points_y[j])50 j += 151 return merged_points52 53 54 result = knapsack_improve([2, 2, 6, 5, 4], [6, 3, 5, 4, 6], 10)55 print()56 for point in result:57 print(39。此處有個受控跳躍點的概念：若點(a,b)，(c,d)∈Pi∪Qi，且a=c，bd，則(c,d)受控于(a,b)，所以(c,d)?Pi1。所以此時m(i,j)=m(i+1,jw[i])+v[i]。 對于此時背包剩余容量 3 4 5 背包容量0~capacity,不是0~capacity1 6 def knapsack(weight, value, capacity): 7 if len(weight) != len(value): 8 print(parameter err!) 9 return10 obj_num = len(weight)