leetcode-master/problems/1049.最后一块石头的重量II.md

// 如何转化为01背包问题

尽量让石头分成，重量相同的两堆，这样就化解成 01背包问题了。

class Solution {
public:
    int lastStoneWeightII(vector<int>& stones) {
        vector<int> dp(30001, 0);
        int sum = 0;
        for (int i = 0; i < stones.size(); i++) sum += stones[i];
        int target = sum / 2;
        for (int i = 0; i < stones.size(); i++) {
            for (int j = target; j >= 0; j--) {
                if (j - stones[i] >= 0) {
                    dp[j] = max(dp[j], dp[j - stones[i]] + stones[i]);
                }
            }
        }
        return sum - dp[target] - dp[target];
    }
};