Given an array containing n distinct numbers taken from 0, 1, 2, ..., n
, find the one that is missing from the array.
Example 1:
Input: [3,0,1] Output: 2
分析:
找到0~n中缺失的数字。可以直接求和比较差值即可。
class Solution {
public:
int missingNumber(vector<int>& nums) {
int sum = 0;
int len = nums.size();
for(int i=0; i<nums.size(); i++)
{
sum += nums[i];
}
return (1+len)*len/2-sum;
}
};