【leetcode】缺失数字

int missingNumber(int* nums, int numsSize){
    int sum= (numsSize+1)*numsSize/2;
    for (int i=0; i<numsSize; i++) sum-=nums[i];
    return sum;
}