2871. 将数组分割成最多数目的子数组
class Solution {
public:
int maxSubarrays(vector<int>& n) {
int ans = 0, a = -1;
for(auto x : n){
a &= x;
if(a == 0){
++ ans; a = -1;
}
}
return max(ans, 1);
}
};
class Solution {
public:
int maxSubarrays(vector<int>& n) {
int ans = 0, a = -1;
for(auto x : n){
a &= x;
if(a == 0){
++ ans; a = -1;
}
}
return max(ans, 1);
}
};