Leecode_Single Number

The Problem:

Given an array of integers, every element appears twice except for one. Find that single one.

Note:

Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
The Solution:
*The ‘XOR’ of a number and itself is 0. So the XOR of all the elements in the array is the Single Number.

public class Solution {

    public int singleNumber(int[] nums) {

        int n = 0;

        for( int i = 0; i < nums.length; i++)

        {

            n ^= nums[i];

        }

        return n;

    }

}