In [17]:
import sys
def cutRod(p, n):
if n == 0:
return 0
q = -sys.maxsize - 1
for i in range(n):
q = max(q, p[i] + cutRod(p, n-i-1))
return q
In [3]:
p = [1, 5, 8, 9, 10, 17, 17, 20, 24, 30, 1, 5, 8, 9, 10, 17, 17, 20, 24, 30, 1, 5, 8, 9, 10]
In [19]:
for i in range(len(p)):
print("i:",i,cutRod(p,i))
In [5]:
def memoizedCutRod(p, n):
r = []
return memoizedCutRodAux(p, n, r)
def memoizedCutRodAux(p, n, r):
q = 0
if len(r) > n:
return r[n]
if n > 0:
q = -1
for i in range(n):
q = max(q, p[i] + memoizedCutRodAux(p, n-i-1, r))
r.append(q)
return q
In [6]:
for i in range(len(p)):
print("i:",i,memoizedCutRod(p,i))
In [15]:
def bottomUpCutRod(p, n):
r = [0]
for j in range(n+1):
q = -1
for i in range(j):
q = max(q, p[i] + r[j-i])
r[j] = q
return r[n]
In [16]:
for i in range(len(p)):
print("i:",i,bottomUpCutRod(p,i))
In [ ]: