Missing Number

https://leetcode.com/problems/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?

数组的长度就是n，如果0，1，2…,n之和就是 ( numsSize + 1 ) * numsSize / 2; 这个值减去数组给定的累加之和，这个差值就是所求的结果。

int missingNumber(int* nums, int numsSize) {

    int i;
    int sum = 0;
    for(i = 0; i < numsSize; i++) {
        sum += nums[i];
    }

    return ((numsSize + 1) * numsSize / 2) - sum;
}