day43 动规.p5

- 1049. 最后一块石头的重量 II 
```cpp
class Solution {

public:

    int lastStoneWeightII(vector<int>& stones) {

        int sum = 0;

        for (int i = 0; i < stones.size(); i++) sum += stones[i];

        int target = sum / 2;

  

        vector<int> dp(1501, 0);

        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]);

            }

        }

  

        return sum - dp[target] * 2;

    }

};
```
- 494. 目标和 
- 计算组合公式，`dp[j] += dp[j - nums[i]];`
```cpp
class Solution {

public:

    int findTargetSumWays(vector<int>& nums, int target) {

        int sum = 0;

        for (int i = 0; i < nums.size(); i++) sum += nums[i];

        if ((sum + target) % 2 == 1) return 0;

        if (abs(target) > sum) return 0;

        int bagSize = (sum + target) / 2;

        vector<int> dp(bagSize + 1, 0);

        dp[0] = 1;

        for (int i = 0; i < nums.size(); i++) {

            for (int j = bagSize; j >= nums[i]; j--) {

                dp[j] += dp[j - nums[i]];

            }

        }

        return dp[bagSize];

    }

};
```
- 474.一和零
```cpp
class Solution {

public:

    int findMaxForm(vector<string>& strs, int m, int n) {

        vector<vector<int>> dp(m + 1, vector<int>(n + 1, 0));

        for (string str : strs) {

            int zeroNum = 0, oneNum = 0;

            for (char c : str) {

                if (c == '0') zeroNum++;

                else oneNum++;

            }

  

            for (int i = m; i >= zeroNum; i--) {

                for (int j = n; j >= oneNum; j--) {

                    dp[i][j] = max(dp[i][j], dp[i - zeroNum][j - oneNum] + 1);

                }

            }

        }

        return dp[m][n];

    }

};
```