Leetcode DAY 42：01背包问题 and 分割等和子集

· 01背包二维   and   01背包一维

#include<iostream>
#include<vector>
using namespace std;

//二维背包
void test()
{
	vector<int> weight = { 1, 3, 4 };
	vector<int> value = { 15, 20, 30 };
	int bagweight = 4;
	//Initialiaztion
	vector<vector<int>> dp(weight.size(), vector<int>(bagweight + 1, 0));
	for (int i = weight[0]; i <= bagweight; i++)
	{
		dp[0][i] = value[0];
	}
	//先遍历物品
	for (int i = 1; i < weight.size(); i++)
	{
		for (int j = 1; j <= bagweight; j++)
		{
			// dp[i][j]表示 选【0 - i】物品放入 背包重量为j的最大价值
			// 不放i物品的价值 ： dp[i-1][j]
			//  放i物品的价值： dp[i-1][j - weight[i]] + value[i]]
			if (weight[i] > j)
			{
				dp[i][j] = dp[i - 1][j];
			}
			else
			{
				dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - weight[i]] + value[i]);
			}
			
		}
	}
	cout << dp[weight.size() - 1][bagweight] << endl;
}
 //一维背包
//需要倒序遍历背包 且 先遍历物品  保证每个物品添加一次
void test2()
{
	vector<int> weight = { 1, 3, 4 };
	vector<int> value = { 15, 20, 30 };
	int bagweight = 4;

	vector<int> dp(bagweight + 1, 0);
	//dp[j] 
	// 没装i物品  dp[j]  
	// 装了i物品  dp[j - weight[i]] + value[i]
	for (int i = 0; i < weight.size(); i++) 
	{
		for (int j = bagweight; j >= weight[i]; j--) 
		{
			dp[j] = max(dp[j], dp[j - weight[i]] + value[i]);
		}
	}
	cout << dp[bagweight] << endl;

}
int main()
{
	test2();
	system("pause");
	return 0;
}

• 416. 分割等和子集

       ~ 背包容量为 sum/2
       ~ 物品价值和重量 都为元素值 也就是nums

• class Solution {
  public:
      bool canPartition(vector<int>& nums) {
          // 背包容量为 sum/2
          // 物品价值和重量 都为元素值 也就是nums
          int n = nums.size();
          int sum = 0;
          for(int i = 0; i < nums.size(); i++) {
              sum += nums[i];
          } 
          if(sum % 2 == 1) return false;
          int bagCapacity = sum / 2;
          // dp 表示背包内的总和
          vector<int> dp(bagCapacity + 1, 0);
          for(int i = 0; i < n; i++) 
          {
              for(int j = bagCapacity; j >= nums[i]; j--) 
              {
                  dp[j] = max(dp[j], dp[j - nums[i]] + nums[i]);
              }
          }
          if(dp[bagCapacity] == bagCapacity) return true;
          return false;
      }
  };