package leetcode;

/**
 * https://leetcode.com/problems/xor-operation-in-an-array/
 */
public class Problem1486 {
    public int xorOperation(int n, int start) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem1486 prob = new Problem1486();
        System.out.println(prob.xorOperation(5, 0)); // 8
        System.out.println(prob.xorOperation(4, 3)); // 8
        System.out.println(prob.xorOperation(1, 7)); // 7
        System.out.println(prob.xorOperation(10, 5)); // 2
    }
}

@@ -167,38 +167,28 @@
     
-// TODO%0A        return
+int answer =
  0;%0A    
 %7D%0A%0A 
@@ -187,334 +187,113 @@
     
-%7D%0A%0A
     
-public static void main(String%5B%5D args) %7B%0A        Problem1486 prob = new Problem1486();%0A        System.out.println(prob.xorOperation(5, 0)); // 8%0A        System.out.println(prob.xorOperation(4, 3)); // 8%0A        System.out.println(prob.xorOperation(1, 7)); // 7%0A        System.out.println(prob.xorOperation(10, 5)); // 2
+for (int i = 0; i %3C n; i++) %7B%0A            answer %5E= start + (2 * i);%0A        %7D%0A        return answer;
 %0A   

Solve problem 1486