1049. Last Stone Weight II

题目：

You are given an array of integers stones where stones[i] is the weight of the ith stone.

We are playing a game with the stones. On each turn, we choose any two stones and smash them together. Suppose the stones have weights x and y with x <= y. The result of this smash is:

• If x == y, both stones are destroyed, and
• If x != y, the stone of weight x is destroyed, and the stone of weight y has new weight y - x.

At the end of the game, there is at most one stone left.

Return the smallest possible weight of the left stone. If there are no stones left, return 0.

Example 1:

Input: stones = [2,7,4,1,8,1]
Output: 1
Explanation:
We can combine 2 and 4 to get 2, so the array converts to [2,7,1,8,1] then,
we can combine 7 and 8 to get 1, so the array converts to [2,1,1,1] then,
we can combine 2 and 1 to get 1, so the array converts to [1,1,1] then,
we can combine 1 and 1 to get 0, so the array converts to [1], then that's the optimal value.

Example 2:

Input: stones = [31,26,33,21,40]
Output: 5

Constraints:

• 1 <= stones.length <= 30
• 1 <= stones[i] <= 100

思路：

题目大意是给一堆石头，拿起任意两个碎掉，如果两个重量相同，则不剩下东西，如果两个重量不同，剩下的石头重为拿起的这两个石头重量差的绝对值，返回最小的剩余值，如果不剩石头返回0。理解一下，这一题其实就是把数组分成两堆，两堆和的差值越小越小，和343. Integer Break几乎是相同的，可以转化为01背包问题。先计算数组和，然后建立二维dp数组。row为0 到 m编号的石头，col为0到n的重量，n是数组和的一半。dp[i][j]即代表在前0 ~ i编号的物品中，背包为j的情况下，能拿的最大重量为多少。最后返回稍微注意下，dp[m - 1][n]最大是n，而n 是sum / 2，向下取整的，所以sum - dp[m - 1][n]一定大于等于dp[m - 1][n]，因此返回(sum - dp[m - 1][n]) - dp[m - 1][n]即为差值。思路2就是用一维的滚动dp数组代替二维dp数组，注意这时候外循环的i要从0开始，而不是1开始，因为一维并没有向二维那样进行初始化。

代码1：

class Solution {
public:
    int lastStoneWeightII(vector<int>& stones) {
        int m = stones.size();
        int sum = accumulate(begin(stones), end(stones), 0);
        int n = sum / 2;
        vector<vector<int>> f(m, vector<int>(n + 1));
        for (int j = stones[0]; j < n + 1; j++) {
            f[0][j] = stones[0];
        }
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n + 1; j++) {
                f[i][j] = f[i - 1][j];
                if (j >= stones[i]) 
                    f[i][j] = max(f[i][j], f[i - 1][j - stones[i]] + stones[i]);
            }
        }
        return sum - f[m - 1][n] - f[m - 1][n];
    }
};

代码2：

class Solution {
public:
    int lastStoneWeightII(vector<int>& stones) {
        int m = stones.size();
        int sum = accumulate(begin(stones), end(stones), 0);
        int n = sum / 2;
        vector<int> f(n + 1);
        for (int i = 0; i < m; i++) {
            for (int j = n; j >= stones[i]; j--) {
                f[j] = max(f[j], f[j - stones[i]] + stones[i]);
            }
        }
        return sum - f[n] - f[n];
    }
};