1049. 最后一块石头的重量
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(target+1, 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-2*dp[target];
}
};
494. 目标和
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(abs(target)>sum) return 0;
int add_sum = (sum+target) /2;
if((sum+target)%2 ==1) return 0;
vector<int> dp(add_sum+1, 0);
dp[0] = 1;
for(int i=0; i<nums.size(); i++){
for(int j = add_sum; j>=nums[i]; j--){
dp[j] += dp[j-nums[i]];
}
}
return dp[add_sum];
}
};
参考文章:代码随想录-494. 目标和
474.一和零
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];
}
};
参考文章:代码随想录- 474.一和零