Leetcode Problem 41. First Missing Positive

41. First Missing Positive

Leetcode Solutions

Check if 1 is present in the array. If not, return 1 as the answer.
Replace negative numbers, zeros, and numbers larger than n by 1s.
For each number a in the array, negate the value at index abs(a) - 1 if it is positive, to mark a as present. Use index 0 to record the presence of n.
Iterate over the array starting from index 1. The first index with a positive value indicates the smallest missing positive integer.
If all values from indices 1 to n - 1 are negative, check the value at index 0. If it's positive, return n, otherwise return n + 1.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen