Simple python backtrack solution
Enumerate all possibilities and check if the statements said by a good person are correct. (no contradition happens)\npython\nclass Solution:\n    def maximumGo
Enumerate all possibilities and check if the statements said by a good person are correct. (no contradition happens)\n```python\nclass Solution:\n    def maximumGood(self, statements: List[List[int]]) -> int:\n      def valid(cur):\n        for i in range(len(statements)):\n          for j in range(len(statements)):\n            if cur[i] == 1 and (statements[i][j] != 2 and statements[i][j] != cur[j]):\n              return False\n        return True\n            \n      def backtrack(cur, i):\n        if i == len(statements):\n          if valid(cur):\n            nonlocal res\n            res = max(res, sum(cur))\n          return\n\n        for j in [0, 1]:\n          cur.append(j)\n          backtrack(cur, i+1)\n          cur.pop()\n\n      res = 0\n      backtrack([], 0)\n      return res\n```
[]