才發(fā)現(xiàn)別人用的是mardown zzz
題目地址：https://leetcode.com/problems/ones-and-zeroes/?tab=Description
還是簡單dp。題意是給出一定數(shù)量的0和1刑峡，以及一個01字符串的數(shù)組伯襟，問這些01能組成多少個字符串汹族。字符串是幌子忿危，先計算里面多少01。然后直接dp
class Solution {
public:
int findMaxForm(vector<string>& strs, int m, int n) {
vector<vector<int>> dp(m+1, vector<int>(n+1, 0));
for (string str : strs) {
int zero = 0, one = 0;
for (char charector : str) {
if (charector == '0') {
zero++;
} else {
one++;
}
}
for (int i = m; i >= zero; i--) {
for (int j = n; j >= one; j--) {
dp[i][j] = max(dp[i][j], dp[i-zero][j-one]+1);
}
}
}
return dp[m][n];
}
};
果然好看多了～smile
