Rod cutting 🌟🌟

Solution

• same as Unbounded Knapsack problem.
• weight array in knapsack = length array in rod cutting.
• value array in knapsack = price array in rod cutting

Code

int cutRod(vector<int> &price, int n)
{
    vector<int> len(n,0);
    for (int i = 0; i < n; i++)
        len[i] = i + 1;
    int maxLen = n;
	return unboundedKnapsack(n, maxLen, price, len);
}