My Solution
\n/**\n * Time Complexity: O(n)\n * Space Complexity: O(1)\n * where `n` is the length of the vector `nums`\n */\nclass Solution {\n public:\n  int maxSubarrays
```\n/**\n * Time Complexity: O(n)\n * Space Complexity: O(1)\n * where `n` is the length of the vector `nums`\n */\nclass Solution {\n public:\n  int maxSubarrays(const vector<int> &nums) {\n    constexpr uint32_t multi_split_target = 0U;\n    int ret = 0;\n    uint32_t score = -1U;\n    for (const int num : nums) {\n      score &= num;\n      if (score == multi_split_target) {\n        ++ret;\n        score = -1U;\n      }\n    }\n    return ret == 0 ? 1 : ret;\n  }\n};\n```
[]