-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathknapsack2.py
More file actions
49 lines (33 loc) · 742 Bytes
/
knapsack2.py
File metadata and controls
49 lines (33 loc) · 742 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
# -*- coding: utf-8 -*-
Num = 4
Wei = 5
V = [3, 2, 4, 2]
W = [2, 1, 3, 4]
memsets = {}
def initialize_memsets():
for i in range(0, 100):
memsets[i] = {}
def register_memsets(i, j, res):
if (memsets.has_key(i) == True):
memsets[i] = {}
memsets[i][j] = res
def rec(i, j):
if (memsets[i].has_key(j) != False):
return memsets[i][j]
res = 0
if (i == Num):
res = 0
elif (j < W[i]):
res = rec(i + 1, j)
else:
left = rec(i + 1, j)
right = rec(i + 1, j - W[i]) + V[i]
res = max(left, right)
register_memsets(i, j, res)
return res
def solve():
print rec(0, Wei)
def __main__():
initialize_memsets()
solve()
__main__()