题目描述
Given an array, strs, with strings consisting of only 0s and 1s. Also two integers m and n.
Now your task is to find the maximum number of strings that you can form with given m 0s and n 1s. Each 0 and 1 can be used at most once.
Example 1:
Input: strs = ["10","0001","111001","1","0"], m = 5, n = 3
Output: 4
Explanation: This are totally 4 strings can be formed by the using of 5 0s and 3 1s, which are "10","0001","1","0".
Example 2:
Input: strs = ["10","0","1"], m = 1, n = 1
Output: 2
Explanation: You could form "10", but then you'd have nothing left. Better form "0" and "1".
Constraints:
1 <= strs.length <= 600
1 <= strs[i].length <= 100
strs[i] consists only of digits '0' and '1'.
1 <= m, n <= 100
思路
dp[i][j]表示当前为止,i个0和j个1的组成方式中,最大的字符串数量。
代码
class Solution {
public:
int findMaxForm(vector<string>& strs, int m, int n) {
int len = strs.size();
vector<vector<int> > dp(m+1, vector<int>(n+1, 0));
for (int i=0; i<len; ++i) {
string str = strs[i];
int cur0 = 0, cur1 = 0;
for (int i=0; i<str.length(); ++i) {
if (str[i] == '0') cur0++;
else if (str[i] == '1') cur1++;
}
for (int j=m-cur0; j>=0; --j) {
for (int k=n-cur1; k>=0; --k) {
dp[j+cur0][k+cur1] = max(dp[j+cur0][k+cur1], dp[j][k]+1);
}
}
}
return dp[m][n];
}
};