leetcode-1486. 数组异或操作

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
class Solution {
    public int xorOperation(int n, int start) {
        int[] nums = new int[n];
        for (int i = 0; i < n; i++) {
            int k = start + 2 * i;
            nums[i] = k;
        }

        int ans = nums[0];
        for (int i = 1; i < n; i++) {
            ans = (ans ^ nums[i]);
        }

        return ans;
    }
}