int missingNumber(int* nums, int numsSize){
int i;
int sum=0;
for(i=0;i<numsSize;i++)
sum=sum+nums[i];
return numsSize*(numsSize+1)/2-sum;
}
leetcode打卡13
最新推荐文章于 2022-11-12 12:02:37 发布
int missingNumber(int* nums, int numsSize){
int i;
int sum=0;
for(i=0;i<numsSize;i++)
sum=sum+nums[i];
return numsSize*(numsSize+1)/2-sum;
}