题目:
Given an unsorted integer array, find the first missing positive integer.
For example,
Given [1,2,0]
return 3
,
and [3,4,-1,1]
return 2
.
Your algorithm should run in O(n) time and uses constant space.
Subscribe to see which companies asked this question
首先声明一个足够大的数组,并初始化其所有值都为0,用于将nums中出现的数字对应到这个数组的下标。
如【3,4,-1,1】就会对应到【0,1,0,3,4】
这样在从头到尾扫一下数组就知道哪个是最先缺失的了
代码:
class Solution {
public:
int firstMissingPositive(vector<int>& nums) {
vector<int> v(1000,0);
for(int i=0;i<nums.size();i++)
{
if(nums[i]>=0)
v[nums[i]]=nums[i];
}
int k=1;
while(v[k]!=0)
{
k++;
}
return k;
}
};