LeetCode268——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.

实现：

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