First Missing Positive

Given an unsorted integer array, print the smallest positive integer that does not appear in it. Required: O(n) time and O(1) extra space.

1 <= n <= 10^5 -2^31 <= nums[i] <= 2^31 - 1