First Missing Positive

Total Accepted: 59335 Total Submissions: 251931 Difficulty: Hard
Given an unsorted integer array, find the first missing positive integer.

For example,
Given [1,2,0] return 3,
and [3,4,-1,1] return 2.

Your algorithm should run in O(n) time and uses constant space.

思路

geeksforgeeks 清晰的解答

results matching ""

    No results matching ""