public class Solution {
public int firstMissingPositive(int[] nums) {
if (nums == null || nums.length == 0) {
return 1;
}
int length = nums.length;
for (int i = 0; i < length; i++) {
while (nums[i] > 0 && nums[i] < length && nums[i] != (i + 1)) {
if (nums[i] == nums[nums[i] - 1]) {
break;
}
int temp = nums[i];
nums[i] = nums[nums[i] - 1];
nums[temp - 1] = temp;
}
}
for (int i = 0; i < length; i++) {
if (nums[i] != (i + 1)) {
return i + 1;
}
}
return length + 1;
}
}