题干:
In the computer world, use restricted resource you have to generate maximum benefit is what we always want to pursue.
For now, suppose you are a dominator of m 0s and n 1s respectively. On the other hand, there is an array with strings consisting of only 0s and 1s.
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.
Note:
The given numbers of 0s and 1s will both not exceed 100
The size of given string array won’t exceed 600.
Example 1:
Input: Array = {“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: Array = {“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”.
题目解析:
这道题目很显然也是动态规划的一个应用,我们使用ans[i][j]表示有i个0和j个1时能生成的字符串数,此题类似于背包问题,递推式如下:
ans[j][k] = max(ans[j][k], ans[j - num_0][k - num_1] + 1);
AC代码如下:
class Solution {
public:
int findMaxForm(vector<string>& strs, int m, int n) {
int size = strs.size();
int ans[m + 1][n + 1] = {0};
for (int i = 0; i <= m; i ++) {
for (int j = 0; j <= n; j ++) {
ans[i][j] = 0;
}
}
for (int i = 0; i < size; i ++) {
string temp = strs[i];
int num_0 = 0, num_1 = 0;
for (char a : temp) {
if (a == '0') {
num_0 ++;
} else if (a == '1') {
num_1 ++;
}
}
for (int j = m; j >= num_0; j --) {
for (int k = n; k >= num_1; k --) {
ans[j][k] = max(ans[j][k], ans[j - num_0][k - num_1] + 1);
}
}
}
return ans[m][n];
}
};