Breaking News: Grepper is joining You.com. Read the official announcement!

0-1 knapsack problem dynamic programming using single array

Happy Hoopoe answered on March 12, 2021 Popularity 10/10 Helpfulness 2/10

answer 0-1 knapsack problem dynamic programming using single array

0-1 knapsack problem dynamic programming using single array

Comment

int dp[MAXW];
int solve()
{
    memset(dp, 0, sizeof(dp));
    for(int i =1; i <= N; i++) {
        for(int j = W; j >= 0; j--) {
            dp[j] = (w[i] > j) ? dp[j]: max(dp[j], dp[j-w[i]] + v[i]);
        }
    }
    return dp[W];
}

Popularity 10/10 Helpfulness 2/10 Language whatever

Source: stackoverflow.com

Tags: dynamic-programming knapsack-problem using whatever

Link to this answer
Share Copy Link

Contributed on Mar 12 2021

Happy Hoopoe

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

0-1 knapsack problem dynamic programming using single array

Contents

More Related Answers

0-1 knapsack problem dynamic programming using single array

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.