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?

Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

方法1：异或，0 - n 缺掉一个元素之后元素个数少了1，因此rs的初值付给nums.size()，这样 i的范围就覆盖了0-n

迭代异或就能得到结果

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

---

方法2：数学方法

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

#stl 中的find

template<class InputIterator, class T>  
  InputIterator find ( InputIterator first, InputIterator last, const T& value )  
  {  
    for ( ;first!=last; first++) if ( *first==value ) break;  
    return first;  
  }  

由此可见，find的查找效率和不同容器的迭代器有所不同。