A Pointless and Terrible One-Liner
Complexity\n- Time complexity: O(n)\n Add your time complexity here, e.g. O(n) \n\n- Space complexity: O(1)\n Add your space complexity here, e.g. O(n) \n\n# Co
# Complexity\n- Time complexity: O(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def maxSubarrays(self, nums: List[int]) -> int:\n        return sum((x := locals().get(\'x\', -1) & n or -1) == -1 for n in nums) or 1\n\n```
['Python3']