LeetCode-in-Net/LeetCodeNet/G0001_0100/S0041_first_missing_positive/Solution.cs at main · jscrdev/LeetCode-in-Net · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
namespace LeetCodeNet.G0001_0100.S0041_first_missing_positive {

// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Udemy_Arrays
// #Big_O_Time_O(n)_Space_O(n) #2025_06_13_Time_2_ms_(75.71%)_Space_64.37_MB_(37.65%)

public class Solution {
    public int FirstMissingPositive(int[] nums) {
        for (int i = 0; i < nums.Length; i++) {
            if (nums[i] <= 0 || nums[i] > nums.Length || nums[i] == i + 1) {
                continue;
            }
            Dfs(nums, nums[i]);
        }
        for (int i = 0; i < nums.Length; i++) {
            if (nums[i] != i + 1) {
                return i + 1;
            }
        }
        return nums.Length + 1;
    }

    private void Dfs(int[] nums, int val) {
        if (val <= 0 || val > nums.Length || val == nums[val - 1]) {
            return;
        }
        int temp = nums[val - 1];
        nums[val - 1] = val;
        Dfs(nums, temp);
    }
}
}