leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

0474.cpp (554B)

0 class Solution { 1 public: 2 int findMaxForm(const vector<string> &strs, int m, int n) const { 3 static int dp[101][101]; 4 5 memset(dp, 0x00, sizeof(dp)); 6 for (const auto &s : strs) { 7 const int zero = count(begin(s), end(s), '0'); 8 const int one = size(s) - zero; 9 for (int i = m; i >= zero; i--) { 10 for (int j = n; j >= one; j--) { 11 dp[i][j] = max(dp[i][j], 1 + dp[i - zero][j - one]); 12 } 13 } 14 } 15 16 return dp[m][n]; 17 } 18 };