Numbers that appear only once in LeetCode

Subject requirements:

Given an array of non-empty integers, each element appears twice except one that appears only once.Find the element that appears only once.

Enter: [2,2,1]Output: 1

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

How to solve the problem:

According to the rule of XOR operation, a^a = 0 ;0^a = a; a^b^a = a^a^b = b;

When the array is XORed, only the individual numbers are left

Code display:

int singleNumber(int* nums, int numsSize){int k=0;for(int i=0;i