第三周leetcode题

description：

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?

按顺序逐项对比的话会超时，因此用等差数列公式计算出vector的应有的和以及它实际的和的差值即可。

solution：

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