LeetCode 1049. 最后一块石头的重量 II

const int N = 3010;
class Solution {
public:
    int dp[N];
    int lastStoneWeightII(vector<int>& stones) {
        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 >= stones[i]; j --)
                dp[j] = max(dp[j], dp[j - stones[i]] + stones[i]);

        //dp[target]表示最大容量为target最多能装多少，注意不一定刚好装满target

        return (sum - dp[target]) - dp[target]; 
    }
};