Skip to content

2871. Split Array Into Maximum Number of Subarrays 👍

  • Time: $O(n)$
  • Space: $O(1)$
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
class Solution {
 public:
  int maxSubarrays(vector<int>& nums) {
    int ans = 0;
    int score = 0;

    for (const int num : nums) {
      score = score == 0 ? num : score & num;
      if (score == 0)
        ++ans;
    }

    return max(1, ans);
  }
};

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
class Solution {
  public int maxSubarrays(int[] nums) {
    int ans = 0;
    int score = 0;

    for (final int num : nums) {
      score = score == 0 ? num : score & num;
      if (score == 0)
        ++ans;
    }

    return Math.max(1, ans);
  }
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
class Solution:
  def maxSubarrays(self, nums: list[int]) -> int:
    ans = 0
    score = 0

    for num in nums:
      score = num if score == 0 else score & num
      if score == 0:
        ans += 1

    return max(1, ans)