https://leetcode-cn.com/problems/xor-operation-in-an-array/
class Solution {
public int xorOperation(int n, int start) {
int res = 0;
for(int i = 0; i < n; i++){
res ^= start + i * 2;
}
return res;
}
}
原文：https://www.cnblogs.com/realzhaijiayu/p/14738707.html