split-array-into-maximum-number-of-subarrays.cpp

// Time:  O(n)
// Space: O(1)

// greedy
class Solution {
public:
    int maxSubarrays(vector<int>& nums) {
        int result = 0, curr = 0;
        for (const auto& x : nums) {
            curr = curr ? curr & x : x;
            if (!curr) {
                ++result;
            }
        }
        return max(result, 1);
    }
};