1、原题如下:
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.
2、解题如下:
class Solution {
public:
int missingNumber(vector<int>& nums) {
int count=nums.size();
int total=count*(count+1)/2;
int temp=0;
for(int i=0;i<nums.size();i++)
{
temp+=nums[i];
}
return total-temp;
}
};
3、总结
本题采用了从总体中减去部分求出missing数值的方法,因为本题跟位置无关,只跟丢失某个数据有关,这种情况下,用整体法会显得比较简单。