C++
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:O(N)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int maxSubarrays(vector<int>& nums) {\n        int bit=INT_MAX;\n        int ans=1;\n        for(int i=0;i<nums.size();i++)\n        {\n            bit=nums[i]&bit;\n            if(bit==0)\n            {\n                ans++;\n                bit=INT_MAX;\n            }\n        }\n        if(bit==INT_MAX||bit>0)ans--;\n       \n        \n        return max(1,ans);\n    }\n};\n```
['C++']