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.
第一次AC代码:
class Solution
{
public:
int missingNumber(vector<int>& nums)
{
int sum=nums.size();
if(sum==0)
return 0;
int temp;
for(int i=0; i<sum; ++i)
{
if(i==nums[i])
continue;
else
{
while(nums[i]!=i)
{
if(nums[i]==sum)
break;
else
{
temp=nums[nums[i]];
nums[nums[i]]=nums[i];
nums[i]=temp;
}
}
}
}
for(int i=0;i<sum;++i)
if(nums[i]!=i)
return i;
return sum;
}
};
第二次排个序就好了。。。。
class Solution
{
public:
int missingNumber(vector<int>& nums)
{
int sum=nums.size();
if(sum==0)
return 0;
sort(nums.begin(),nums.end());
for(int i=0;i<sum;++i)
if(nums[i]!=i)
return i;
return sum;
}
};
题目要求线性时间,常数空间
所有总共有有N+1个数字,则所有的的数字0~N的数字的和为sum=(1+N)*(N/2)
然后用sum减去数组中的任何一个元素,则是缺少的那一个数字!
AC代码
class Solution {
public:
int missingNumber(vector<int>& nums) {
int sum=nums.size();
int res=(1+sum)*sum/2;
for(int i=0;i<sum;++i)
res-=nums[i];
return res;
}
};
其他Leetcode题目AC代码:https://github.com/PoughER/leetcode