23-09-30 biweekly contest 114

(greedy) split-array-into-maximum-number-of-subarrays

https://leetcode.com/contest/biweekly-contest-114/problems/split-array-into-maximum-number-of-subarrays/

by https://leetcode.com/FransV/

class Solution:
    def maxSubarrays(self, nums: List[int]) -> int:
        
        count = 0
        val = nums[0]
        n = len(nums) - 1
        for i, item in enumerate(nums):
            val &= item
            if val == 0:
                count += 1
                if i != n:
                    val = nums[i+1]
                
        return max(count, 1)