python brute force
\tclass Solution:\n\t\tdef maximumRows(self, mat: List[List[int]], cols: int) -> int:\n\t\t\tm = len(mat)\n\t\t\tn = len(mat[0])\n\t\t\tres = 0\n\t\t\tfor combi
\tclass Solution:\n\t\tdef maximumRows(self, mat: List[List[int]], cols: int) -> int:\n\t\t\tm = len(mat)\n\t\t\tn = len(mat[0])\n\t\t\tres = 0\n\t\t\tfor combination in combinations(range(n), cols):\n\t\t\t\tcnt = 0\n\t\t\t\tfor i in range(m):\n\t\t\t\t\tcheck = True\n\t\t\t\t\tfor j in range(n):\n\t\t\t\t\t\tif mat[i][j] == 1 and j not in combination:\n\t\t\t\t\t\t\tcheck = False\n\t\t\t\t\t\t\tbreak\n\t\t\t\t\tif check:\n\t\t\t\t\t\tcnt += 1\n\t\t\t\tres = max(res, cnt)\n\t\t\treturn res
[]