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
.
解决方案:
class Solution {
public:
int missingNumber(vector<int>& nums) {
for(int i=1;i<nums.size();i++)
{
nums[0]+=nums[i];
}
return ((1+nums.size())*nums.size()/2-nums[0]);
}
};