Remove Boxes

题目描述

Given several boxes with different colors represented by different positive numbers.
You may experience several rounds to remove boxes until there is no box left. Each time you can choose some continuous boxes with the same color (composed of k boxes, k >= 1), remove them and get k*k points.
Find the maximum points you can get.

思路分析

这题算是有一定难度，想来想去都没有什么思路，最后只能看看大神的博客o(╥﹏╥)o
理一下实现的思路：
用动态规划的方法解决数组和子数组的问题，首先定义数组dp[i][j][k]表示boxes数组从i 到 j之间最大的点数，其中k是指这段区间前与boxes[i]相等的元素个数。 1）当直接将boxes[i]和前面k个相同的元素去掉时，我们得到：dp[i][j][k]=dp[i+1][j][0]+(k+1)*(k+1)；2）当考虑到boxes[i]到boxes[j]之间存在boxes[m]==boxes[i]时，我们先将boxes[i+1]到boxes[m-1]之间的元素移除，再将boxes[m]和boxes[i]合并相连，就可以得到：dp[i][j][k]=dp[i+1][m-1][0]+dp[m][j][k+1]。最后，取两种情况下的最大值作为dp[i][j][k]的值大小。
因此，boxes数组的最大点数就是dp[0][len-1][0]。

代码实现

class Solution {
public:
    int removeBoxes(vector<int>& boxes) {
        int len = boxes.size();
        int dp[100][100][100] = {0};
        return subRemoveBoxes(boxes, 0, len-1, 0, dp);
    }
    int subRemoveBoxes(vector<int>& boxes, int i, int j, int k, int dp[100][100][100]) {
        if (i > j) 
            return 0;
        if (dp[i][j][k] > 0)
            return dp[i][j][k];
        //移除boxes[i]
        int result = subRemoveBoxes(boxes, i+1, j, 0, dp) + (k+1)*(k+1);
        //从boxes[i]到boxes[j]之间存在boxes[m]==boxes[i]
        for (int m = i+1; m <= j; m++) {
            if (boxes[m] == boxes[i]) {
                int count = subRemoveBoxes(boxes, i+1, m-1, 0, dp) + subRemoveBoxes(boxes, m, j, k+1, dp);
                result = max(count, result);
            }
        }
        return dp[i][j][k] = result;
    }
};