Problem Description
Given an unsorted integer array nums. Return the smallest positive integer that is not present in nums.
For instance, in the array [1, 3, 5, 0, -1, 9], 1 is present, making 2 the smallest positive integer not present.
Example 1:
Input: nums = [3,4,-1,1]
Output: