[Easy] 268. Missing Number

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.

Example 1:

Input: [3,0,1]
Output: 2

Example 2:

Input: [9,6,4,2,3,5,7,0,1]
Output: 8

Solution

Bit Operation

Runtime: 36 ms, faster than 48.61% of C++ online submissions for Missing Number.
Memory Usage: 18 MB, less than 5.88% of C++ online submissions for Missing Number.

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