代码:
class Solution {
public:
bool canPartition(vector<int>& nums) {
vector<int> dp(10001, 0);
int sum = 0;
for (int i = 0; i < nums.size(); ++i) {
sum += nums[i];
}
if (sum % 2 == 1)return false;
int target = sum / 2;
for (int i = 0; i < nums.size(); ++i) {
for (int j = target; j >= nums[i]; --j) {
dp[j] = max(dp[j], dp[j - nums[i]] + nums[i]);
}
}
if (dp[target] == target)
return true;
return false;
}
};
代码:
class Solution {
public:
int lastStoneWeightII(vector<int>& stones) {
vector<int> dp(1501, 0);
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]);
}
}
return sum - dp[target] - dp[target];
}
};
代码:
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 bigSize = (target + sum) / 2;
vector<int> dp(bigSize + 1, 0);
dp[0] = 1;
for (int i = 0; i < nums.size(); ++i) {
for (int j = bigSize; j >= nums[i]; --j) {
dp[j] += dp[j - nums[i]];
}
}
return dp[bigSize];
}
};
代码:
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 oneNum = 0, zeroNum = 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];
}
};
参考资料:
代码随想录