Find the XOR of Numbers Which Appear Twice
You are given an array nums, where each number in the array appears either once or twice.
Return the bitwise XOR of all the numbers that appear twice in the array, or 0 if no number appears twice.
Example 1
Input
nums = [1,2,1,3]Output
1The only number that appears twice in
nums is 1.Example 2
Input
nums = [1,2,3]Output
0No number appears twice in
nums.Constraints
- 1 <= nums.length <= 50
- 1 <= nums[i] <= 50
- Each number in
numsappears either once or twice.