def missing_number(nums):
result=len(nums)
for i,n in enumerate(nums):
result^=i^n
return result
public int missingNumber(int[] nums){
int result=nums.length;
for(int i=0;i<nums.length;i++)
result^=i^nums[i];
return result;
}
XOR approach. enumerate vs manual index.
def missing_number(nums):
result=len(nums)
for i,n in enumerate(nums):
result^=i^n
return result
public int missingNumber(int[] nums){
int result=nums.length;
for(int i=0;i<nums.length;i++)
result^=i^nums[i];
return result;
}
1. XOR all indices and values 2. Missing appears once