Easy-48

leetcode      268. Missing Number           

Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.

For example,
Given nums = [0, 1, 3] return 2.

Note:
Your algorithm should run in linear runtime complexity. Could you implement it using only constant extra space complexity?

AC;

int missingNumber(int* nums, int numsSize) {
    int result=numsSize;
    for(int i=0;i<numsSize;i++)
    {
        result^=nums[i]^i;
    }
    return result;
}

tips:根据之前编程的题目，马上想到了异或操作。