方法:01背包
class Solution {
#define maxn 1510
int dp[maxn];
public:
int lastStoneWeightII(vector<int>& stones) {
int sum = accumulate(stones.begin(), stones.end(), 0);
int t = sum/2;
int n = stones.size();
for (int i = 0; i < stones.size(); ++i) {
for (int j = t; j >= stones[i]; --j) {
dp[j] = max(dp[j], dp[j-stones[i]] + stones[i]);
}
}
return sum - dp[t] - dp[t];
}
};
$时间复杂度O(n*m),空间复杂度O(t)
方法:01背包(求方案数)
class Solution {
public:
int findTargetSumWays(vector<int>& nums, int target) {
int sum = accumulate(nums.begin(), nums.end(), 0);
if ((target+sum) % 2 == 1 || 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];
}
};
$时间复杂度O(n*m),空间复杂度O(target)
方法:01背包(二维费用)
class Solution {
#define maxn 110
int dp[maxn][maxn];
public:
int findMaxForm(vector<string>& strs, int m, int n) {
for (auto& str : strs) {
int one = 0, zero = 0;
for (char& c : str) {
if (c == '0') ++zero;
else ++one;
}
for (int i = m; i >= zero; --i) {
for (int j = n; j >= one; --j) {
dp[i][j] = max(dp[i][j], dp[i-zero][j-one] + 1);
}
}
}
return dp[m][n];
}
};
$时间复杂度O(strs.size()*n*m),空间复杂度O(n*m)