Clear and Simple to Understand
Intuition\nIf the AND of the whole array is greater than 1 then the answer will be 1 , otherwise, keep on taking AND untill the val becomes 0, when it becomes 0
# Intuition\nIf the AND of the whole array is greater than 1 then the answer will be 1 , otherwise, keep on taking AND untill the val becomes 0, when it becomes 0, increase the value of answer by one.\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 {\n    public int maxSubarrays(int[] nums) {\n        \n        int min=nums[0];\n        for(int i=1;i<nums.length;++i){\n            min&=nums[i];\n        }\n\n        if(min>0) return 1;\n\n        int ans=1;\n        int temp=nums[0];\n        for(int i=1;i<nums.length;++i){\n            if(temp==0){\n                ans++;\n                temp=nums[i];\n            }\n            else\n                temp&=nums[i];\n            if(i==nums.length-1 && temp>0)\n                ans--;\n        }\n        return ans;\n    }\n}\n```
['Greedy', 'Bit Manipulation', 'Python', 'Java', 'Python3']