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
.
思路:
对于0-n的数列,应用求和公式为( 0 + nums.size() + 1)* nums.size() /2,对于数列中有一个数缺省的情况,求出vector容器里所有的值的总和,相减即可。
class Solution {
public:
int missingNumber(vector<int>& nums) {
int sum1 = ( 0 + nums.size() + 1)* nums.size() /2;
int sum2 = 0;
for(int i = 0; i < nums.size(); i++)
{
sum2 += nums[i];
}
return sum1 - sum2;
}
};