1
class Solution {
2
  public int xorOperation(int n, int start) {
3
    int nums[] = new int[n];
4
    for (int i = 0; i < n; i++) nums[i] = start + 2 * i;
5
    for (int i = 1; i < n; i++) nums[i] = nums[i - 1] ^ nums[i];
6
    return nums[n - 1];
7
  }
8
}