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?

题意：给你一列数，求缺少的数字,要求时间复杂度为线性阶

异或：

class Solution {
public:
    int missingNumber(vector<int>& nums) 
    {
        int res=nums.size();
        for (int i=0;i<nums.size();i++)
        {
           res=res^nums[i]^i;
        }
        return res;
    }
};