1
# Runtime: 7928 ms (Top 10.31%) | Memory: 14.1 MB (Top 82.43%)
2
class Solution:
3
    def findMaxForm(self, strs: List[str], m: int, n: int) -> int:
4
        dp = [[0 for _ in range(m + 1)] for _ in range(n + 1)]
5
        for s in strs:
6
            zeroes = s.count("0")
7
            ones = len(s) - zeroes
8
            for i in range(n, ones - 1, -1):
9
                for j in range(m, zeroes - 1, -1):
10
                    dp[i][j] = max(dp[i][j], dp[i - ones][j - zeroes] + 1)
11
        return dp[n][m]