https://leetcode.com/problems/bitwise-ors-of-subarrays/

bitwise-ors-of-subarrays.java

class Solution {
    public int subarrayBitwiseORs(int[] A) {
        Set<Integer> result = new HashSet<>();
        Set<Integer> current = new HashSet<>();
        
        for (int num : A) {
            Set<Integer> temp = new HashSet<>();
            temp.add(num);
            for (int pre : current) {
                temp.add(num | pre);
            }
            
            result.addAll(temp);
            current = temp;
        }
        
        return result.size();
    }
}