Easy Bit Manipulation Solution | 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:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\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 a=INT_MAX;\n        for(auto i:nums)a&=i;\n        if(a!=0)return 1;\n        a=INT_MAX;\n        int cnt=0;\n        for(auto i:nums){\n            a&=i;\n            if(a==0){\n                cnt++;\n                a=INT_MAX;\n            }\n        }\n        return cnt;\n    }\n};\n```
['Bit Manipulation', 'Bitmask', 'C++']