LeetCode-474. Ones and Zeroes[这里是图片001]https://leetcode.com/problems/ones-and-zeroes/
题目描述
You are given an array of binary stringsstrs
and two integersm
andn
.
Return_the size of the largest subset ofstrs
such that there areat mostm``0
’s and_n``1
's in the subset.
A setx
is asubsetof a sety
if all elements ofx
are also elements ofy
.
Example 1:
Input: strs = [“10”,“0001”,“111001”,“1”,“0”], m = 5, n = 3
Output: 4
Explanation: The largest subset with at most 5 0’s and 3 1’s is {“10”, “0001”, “1”, “0”}, so the answer is 4.
Other valid but smaller subsets include {“0001”, “1”} and {“10”, “1”, “0”}.
{“111001”} is an invalid subset because it contains 4 1’s, greater than the maximum of 3.
Example 2:
Input: strs = [“10”,“0”,“1”], m = 1, n = 1
Output: 2
Explanation: The largest subset is {“0”, “1”}, so the answer is 2.
Constraints:
1 <= strs.length <= 600
1 <= strs[i].length <= 100
strs[i]
consists only of digits'0'
and'1'
.1 <= m, n <= 100
解题思路
这是一个多维费用的0-1 背包问题,有两个背包大小,0 的数量和1 的数量。这里采用三维压缩到 二维的方法。
【C++】
class Solution {
public:
int findMaxForm(vector<string>& strs, int m, int n) {
vector<vector<int>> dp(m + 1, vector<int>(n + 1, 0));
for (auto & str: strs) {
int zeroes = 0, ones = 0;
for (char bits : str) {(bits - '0' > 0) ? ones++ : zeroes++;}
for (int i = m; i >= zeroes; --i) {
for (int j = n; j >= ones; --j) {
dp[i][j] = max(dp[i][j], 1 + dp[i-zeroes][j-ones]);
}
}
}
return dp[m][n];
}
};
【Java】
class Solution {
public int findMaxForm(String[] strs, int m, int n) {
int[][] dp = new int[m + 1][n + 1];
for (String str: strs) {
int zeroes = 0, ones = 0;
for (char bits : str.toCharArray()) {
if (bits == '1') {ones++;}
else {zeroes++;}
}
for (int i = m; i >= zeroes; --i) {
for (int j = n; j >= ones; --j) {
dp[i][j] = Math.max(dp[i][j], 1 + dp[i-zeroes][j-ones]);
}
}
}
return dp[m][n];
}
}
参考文献
【1】Java中的三元运算符?: error: not a statement_dajiangqingzhou的专栏-CSDN博客