代码随想录day35 01背包问题二维 01背包问题一维 416. 分割等和子集

最新推荐文章于 2024-09-09 15:00:54 发布

咸鱼的自我变强之路

最新推荐文章于 2024-09-09 15:00:54 发布

阅读量132

点赞数 2

分类专栏：代码随想录_刷题文章标签： leetcode 算法

本文链接：https://blog.csdn.net/weixin_45461296/article/details/140960714

版权

代码随想录_刷题专栏收录该内容

61 篇文章 0 订阅

订阅专栏

代码随想录day35 01背包问题二维 01背包问题一维 416. 分割等和子集

01背包问题二维

代码随想录

#include <bits/stdc++.h>
using namespace std;

int main() {
    int m, n;
    cin >> m >> n;
    vector<int> weights(m, 0);
    vector<int> values(m, 0);
    for (int i = 0; i < m; i++) {
        cin >> weights[i];
    }
    for (int i = 0; i < m; i++) {
        cin >> values[i];
    }
    vector<vector<int>> dp(m, vector<int>(n + 1, 0));
    for (int weight = 0; weight <= n; weight++) {
        if (weights[0] <= weight) {
            dp[0][weight] = values[0];
        }
    }
    for (int row = 1; row < m; row++) {
        for (int col = 1; col <= n; col++) {
            if (col >= weights[row]) {
                dp[row][col] = max(dp[row - 1][col], dp[row - 1][col - weights[row]] + values[row]);
            } else {
                dp[row][col] = dp[row - 1][col];
            }
        }
    }
    cout << dp[m - 1][n];
    return 0;
}

01背包问题一维

代码随想录

#include <bits/stdc++.h>
using namespace std;

int main() {
    int m, n;
    cin >> m >> n;
    vector<int> weights(m, 0);
    vector<int> values(m, 0);
    for (int i = 0; i < m; i++) {
        cin >> weights[i];
    }
    for (int i = 0; i < m; i++) {
        cin >> values[i];
    }
    vector<int> dp(n + 1, 0);
    for (int i = 0; i < m; i++) {
        for (int j = n; j > 0; j--) {
            if (j >= weights[i]) {
                dp[j] = max(dp[j], dp[j - weights[i]] + values[i]);
            }
        }
    }
    cout << dp[n];
    return 0;
}

416. 分割等和子集

代码随想录


class Solution {
public:
    bool canPartition(vector<int>& nums) {
        int sum = 0;
        int len = nums.size();
        for (int i = 0; i < len; i++) {
            sum += nums[i];
        }
        if (sum % 2 == 1) return false;
        int target = sum / 2;
        vector<int> dp(target + 1, 0);
        for (int i = 0; i < len; i++) {
            for (int j = target; j >= nums[i]; j--) {
                dp[j] = max(dp[j], dp[j - nums[i]] + nums[i]);
            }
        }
        return dp[target] == target;
    }
};