Simple solution without 'bitmask' . Runtime 100%
\n\n\nclass Solution:\n    def maxSubarrays(self, nums: List[int]) -> int:\n        total, cnt = 0, 0\n        for n in nums:\n            if not total:\n      
![\u0421\u043D\u0438\u043C\u043E\u043A \u044D\u043A\u0440\u0430\u043D\u0430 2024-01-08 \u0432 01.27.52.png](https://assets.leetcode.com/users/images/bb289903-5b92-4d3d-a5b2-65b9c02096cc_1704666486.4649506.png)\n\n```\nclass Solution:\n    def maxSubarrays(self, nums: List[int]) -> int:\n        total, cnt = 0, 0\n        for n in nums:\n            if not total:\n                total = n\n                cnt += 1\n            else:\n                total &= n\n        return cnt-1 if total and cnt != 1 else cnt       \n```
['Python3']