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.
Java:
public class Solution {
public int firstMissingPositive(int[] nums) {
for(int i=0;i<nums.length;i++)
{
if(nums[i] <= 0) continue;
else if(nums[i] <nums.length && nums[nums[i]-1] != nums[i])
{
int temp = nums[nums[i]-1];
nums[nums[i]-1] = nums[i];
nums[i] = temp;
i--;
}
}
for(int j=0;j<nums.length;j++)
{
if(nums[j] != j+1 ) return j+1;
}
return nums.length+1;
}
}
注意:之前忘记加nums[nums[i]-1] != nums[i]的判定条件了