Winter vacation daily question -- a single element in an ordered array

• Topic link ：https://leetcode-cn.com/problems/single-element-in-a-sorted-array/
• Title Description

 Give you an ordered array of integers only , Each of these elements will appear twice , Only one number will appear once .

 Please find and return the number that only appears once .

• Example

 Input : nums = [1,1,2,3,3,4,4,8,8]
 Output : 2

Ideas

Using the properties of XOR .

0 ⊕ n = n 0 And n XOR equals n

n ⊕ n = 0 The XOR operation of any two identical numbers equals 0

• Code

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