Leetcode topic resolution single number

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?

For the appearance of 2 Secondary figures , Using XOR . because “ Dissimilarity is 1”, So a digital XOR itself is 0, and 0 Exclusive or 0 Still 0, A number is XOR 0 Still this number .

0 ^ 0 = 0 
n ^ 0 = n 
n ^ n = 0

    public int singleNumber(int[] nums) {
        int n = 0;
        for (int i : nums) {
            n ^= i;
        }
        return n;
    }