474. Ones and Zeroes
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“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”.
题意：给m个0，n个1，问最多能构成多少个字符串。 难度Medium。背包思想。
class Solution { public: int findMaxForm(vector<string>& strs, int m, int n) { int dp[110][110], cnt0, cnt1; memset(dp,0,sizeof(dp)); for(int i=0; i< strs.size(); i++) { cnt0 = cnt1 = 0; for(int j=0; strs[i][j]; j++) if(strs[i][j]=='0') cnt0++; else cnt1++; for(int p = m; p - cnt0>=0 ;p--) { for(int q = n; q - cnt1>=0 ; q--) { dp[p][q] = max(dp[p-cnt0][q-cnt1]+1,dp[p][q]); } } } return dp[m][n]; } };