首页 > itarticle > 268. missing number

268. missing number

admin 11月 12, 2020 0

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.


class  {
public:
    int missingNumber(vector<int>& nums) {
        int sum1=0,sum2=0;
        int result=0;

        for(int i=0;i<nums.size();i++){
            result^=i;
            result^=nums[i];
        }
        result^=nums.size();
        return result;
    }
};