1049. Last Stone Weight II

We have a collection of rocks, each rock has a positive integer weight.

Each turn, we choose any two rocks 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 totally destroyed;
If x != y, the stone of weight x is totally destroyed, and the stone of weight y has new weight y-x.
At the end, there is at most 1 stone left. Return the smallest possible weight of this stone (the weight is 0 if there are no stones left.)

Example 1:

Input: [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.

Note:

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

方法1: dynamic programming，knapsack

class Solution {
public:
    int lastStoneWeightII(vector<int>& stones) {
        int sum = accumulate(stones.begin(), stones.end(), 0);
        vector<int> dp(sum + 1, 0);
        dp[0] = 1;
        for (int i = 0; i < stones.size(); i++) {
            for (int j = sum; j >= 0; j--) {
                if (j - stones[i] >= 0) {
                    dp[j] |= dp[j - stones[i]];
                }
            }
        }
        int result = INT_MAX;
        for (int i = 1; i < dp.size(); i++) {
            if (dp[i] > 0)
                result = min(result, abs(sum - 2 * i));
        }
        return result;
    }
};