ejemplo de código explicado por Python del problema de la mochila

Te recomendamos que revises esta resolución en un entorno controlado antes de pasarlo a producción, saludos.

Ejemplo 1: mochila python 0-1

#Returns the maximum value that can be stored by the bagdefknapSack(W, wt, val, n):# initial conditionsif n ==0or W ==0:return0# If weight is higher than capacity then it is not includedif(wt[n-1]> W):return knapSack(W, wt, val, n-1)# return either nth item being included or notelse:returnmax(val[n-1]+ knapSack(W-wt[n-1], wt, val, n-1),
         knapSack(W, wt, val, n-1))# To test above function
val =[50,100,150,200]
wt =[8,16,32,40]
W =64
n =len(val)print(knapSack(W, wt, val, n))

Ejemplo 2: algoritmo de mochila en python

# a dynamic approach# Returns the maximum value that can be stored by the bagdefknapSack(W, wt, val, n):
   K =[[0for x inrange(W +1)]for x inrange(n +1)]#Table in bottom up mannerfor i inrange(n +1):for w inrange(W +1):if i ==0or w ==0:
            K[i][w]=0elif wt[i-1]<= w:
            K[i][w]=max(val[i-1]+ K[i-1][w-wt[i-1]], K[i-1][w])else:
            K[i][w]= K[i-1][w]return K[n][W]#Main
val =[50,100,150,200]
wt =[8,16,32,40]
W =64
n =len(val)print(knapSack(W, wt, val, n))

Te invitamos a sostener nuestro quehacer escribiendo un comentario o dejando una puntuación te damos las gracias.

---

---

Utiliza Nuestro Buscador