[Coding Made Simple] Cutting Rod for max profit

Given a rod of length and prices at which different length of this rod can sell, how do you cut this rod to maximize profit.

 

Solution. Dynamic Programming

State: T[i][j]: the max profit when the rod's length is j and the first i cutting methods are available. 

Function: T[i][j] = max{T[i - 1][j],  entries[i - 1].profit + T[i][j - entries[i - 1].len]},   if j >= entries[i - 1].len;

　　　　 T[i][j] = T[i - 1][j], if j < entries[i - 1].len;

For a given cutting method of certain length and profit, we can only use this method when the current rod's length is at least as long as the cut length.

1. If the current rod's length is shorter than the cut length, then the max profit we can have is simply the same rod's length without using this cut length at all. 

2. Otherwise, the max profit is the max of either not using the current cut length or using it. 

 

import java.util.ArrayList;

class LenAndProfit {
    int len;
    int profit;
    LenAndProfit(int l, int p) {
        this.len = l;
        this.profit = p;
    }
}
public class CuttingRod {
    private ArrayList<Integer> cuts;
    public int getMaxProfit(int totalLen, LenAndProfit[] entries) {
        int[][] T = new int[entries.length + 1][totalLen + 1];
        for(int i = 0; i <= entries.length; i++) {
            T[i][0] = 0;
        }
        for(int j = 0; j <= totalLen; j++) {
            T[0][j] = 0;
        }
        for(int i = 1; i < T.length; i++) {
            for(int j = 1; j <= totalLen; j++) {
                if(j >= entries[i - 1].len) {
                    T[i][j] = Math.max(T[i - 1][j], entries[i - 1].profit + T[i][j - entries[i - 1].len]);
                }
                else {
                    T[i][j] = T[i - 1][j];
                }
            }
        }
        cuts = getMaxProfitCut(T, entries);
        return T[entries.length][totalLen];
    }
    private ArrayList<Integer> getMaxProfitCut(int[][] T, LenAndProfit[] entries) {
        ArrayList<Integer> cuts = new ArrayList<Integer>();
        int i = T.length - 1, j = T[0].length - 1;
        while(T[i][j] != 0) {
            if(T[i - 1][j] == T[i][j]) {
                i--;
            }
            else {
                cuts.add(entries[i - 1].len);
                j -= entries[i - 1].len;
            }
        }
        return cuts;
    }
}

 

Related Problems

BackPack