问题描述:
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
.
Note:
Your algorithm should run in linear runtime complexity. Could you implement it using only constant extra space complexity?
Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.
思路:
1、首先先要将特例(边界情况)都考虑完整,比如nums中只有一个数的情况;
2、其次最关键的是普通情况,由于nums中的数都是无序的,所以要找到nums中最大的数必须遍历一遍;
3、最后如果这个最大的数是边界,那么就要用到一个公式:1+2+...+n = n*(n+1) /2;对nums求和,然后用n*(n+1) /2减去求和结果就是缺失的数;如果最大的数不是边界,那么缺少的数就是边界。
代码:
class Solution {
public:
int missingNumber(vector<int>& nums) {
if(nums[0] == 0 && nums.size() == 1)
return 1;
if(nums[0] > 0 && nums.size() == 1)
{
return nums[0] - 1;
}
int sum = 0;
int max = nums[0];
for(vector<int>::iterator it = nums.begin();it != nums.end();it++)
{
sum += *it;
if(*it > max)
max = *it;
}
if(max < nums.size())
{
return (max + 1);
}
else if(max == nums.size())
{ int sumall = max * (max + 1) / 2;
int result = sumall - sum;
return result;
}
}
};