First Missing PositiveHardAcceptance Rate 36.8%Given an unsorted integer array nums, return the smallest missing positive integer.ExamplesExample 1Inputnums = [1,2,0]Output3Constraints1 <= nums.length <= 5 * 10^5-2^31 <= nums[i] <= 2^31 - 1