EASY SOLUTION FOR BEGINERS // JAVA
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 {\n    public int maxSubarrays(int[] nums) {\n        int totaland = nums[0];\n        for(int i = 0;i<nums.length; i++){\n            totaland &= nums[i];\n        }\n        if(totaland != 0) return 1;\n        int currentand = -1;\n        int ans = 0;\n        for(int i =0;i<nums.length;i++){\n            if(currentand == -1) currentand = nums[i];\n            else{\n                currentand &= nums[i];\n            }\n            if(currentand == 0){\n                ans++;\n                currentand = -1;\n            }\n        }\n        return ans;\n\n        \n    }\n}\n```
['Java']