最后一块石头的重量 II
题目详细:LeetCode.1049
详细的题解可查阅:《代码随想录》— 最后一块石头的重量 II
Java解法(动态规划,01背包(一维)):
class Solution {
public int lastStoneWeightII(int[] stones) {
int sum = Arrays.stream(stones).sum(), target = sum / 2;
int[] dp = new int[15*100 + 1];
for(int i = 0; i < stones.length; i++){
for(int j = target; j >= stones[i]; j--){
dp[j] = Math.max(dp[j], dp[j - stones[i]] + stones[i]);
}
}
return (sum - dp[target]) - dp[target];
}
}
目标和
题目详细:LeetCode.494
详细的题解可查阅:《代码随想录》— 目标和
Java解法(动态规划,01背包(一维)):
class Solution {
public int findTargetSumWays(int[] nums, int target) {
int sum = Arrays.stream(nums).sum();
if(Math.abs(target) > sum)
return 0;
if((target + sum) % 2 == 1)
return 0;
int bagSize = (target + sum) / 2;
int[] dp = new int[bagSize + 1];
dp[0] = 1;
for(int i = 0; i < nums.length; i++){
for(int j = bagSize; j >= nums[i]; j--){
dp[j] += dp[j - nums[i]];
}
}
return dp[bagSize];
}
}
一和零
题目详细:LeetCode.474
详细的题解可查阅:《代码随想录》— 一和零
Java解法(动态规划,01背包(一维)):
class Solution {
public int findMaxForm(String[] strs, int m, int n) {
int[][] dp = new int[m + 1][n + 1];
for(String str: strs){
int zeroNum = 0, oneNum = 0;
for(char c: str.toCharArray()){
if(c == '0')
zeroNum++;
else
oneNum++;
}
for(int i = m; i >= zeroNum; i--){
for(int j = n; j >= oneNum; j--){
dp[i][j] = Math.max(dp[i][j], dp[i - zeroNum][j - oneNum] + 1);
}
}
}
return dp[m][n];
}
}