2016年4月22日
Dynamic programming---backpack problem
weight=[0,1,3,4,8]value=[0,4,3,2,5]c=9m = [[0]*10 for i in range(10)] def min(x,y): if x < y: return x else: return y def package(weight, value, n, to Read More
posted @ 2016-04-22 20:50 zhaodonglin Views(107) Comments(0) Diggs(0)