動態(tài)規(guī)劃之01背包問題及改進(jìn)-資料下載頁
2025-07-22 00:49本頁面
【正文】 , jump_points_q[1])22 return result23 24 25 def merge_points(points_x, points_y):26 x_len = len(points_x)27 y_len = len(points_y)28 merged_points = []29 i = j = 030 while True:31 if i == x_len or j == y_len:32 break33 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。(39。 + str() + 39。,39。 + str() + 39。)39。, end=39。 39。)58 59 (0,0) (2,6) (4,9) (6,12) (8,15)
黨政相關(guān)相關(guān)推薦
鄂ICP備17016276號-1