package leetcode;

/**
 * https://leetcode.com/problems/bitwise-ors-of-subarrays/
 */
public class Problem898 {
    public int subarrayBitwiseORs(int[] A) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem898 prob = new Problem898();
        System.out.println(prob.subarrayBitwiseORs(new int[]{0})); // 1
        System.out.println(prob.subarrayBitwiseORs(new int[]{1, 1, 2})); // 3
        System.out.println(prob.subarrayBitwiseORs(new int[]{1, 2, 4})); // 6
    }
}

@@ -508,16 +508,97 @@
 ); // 6%0A
+        System.out.println(prob.subarrayBitwiseORs(new int%5B%5D%7B1, 2, 4, 5%7D)); // 7%0A
     %7D%0A%7D%0A

Update problem 898