LeetCode-268. Missing Number

问题：https://leetcode.com/problems/missing-number/?tab=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.
分析：求等差数列的前n项和，再依次减去数列中的数，最后就得到缺少的那个数了。
C++代码：

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