Menengah Exercism • haskell

Knapsack

Ringkasan Tantangan

Given a knapsack that can only carry a certain weight, determine which items to put in the knapsack in order to maximize their combined value.

Visit the knapsack exercise on Exercism to read the full instructions and download the exercise files.

Community Solutions

Lihat Solusi Komunitas

The following are the top 3 community solutions by stars:

Solution 1 by @Krogh33 (⭐ 2) — View on Exercism
Solution 2 by @Dani-Rybe (⭐ 0) — View on Exercism
Solution 3 by @chicolismo (⭐ 0) — View on Exercism

Source: Exercism haskell/knapsack

💡 Lihat Solusi

module Knapsack (maximumValue) where

maximumValue :: Int -> [(Int, Int)] -> Int
maximumValue = go
  where
    go _ [] = 0
    go limit ((w, v) : xs)
      | w > limit = go limit xs
      | otherwise = max (v + go (limit - w) xs) (go limit xs)