Chalkboard XOR Game LeetCode solution in Java

1
class Solution {
2
  public boolean xorGame(int[] nums) {
3
    int x = 0;
4
    for (int i = 0; i < nums.length; i++) {
5
      x ^= nums[i];
6
    }
7
    // if(x==0 || nums.length%2==0) // **This also works **
8
    //     return true;
9
    // return false;
10
    return (x == 0 || nums.length % 2 == 0);
11
  }
12
}