Question

How to get the first missing smallest positive integer in an unsorted integer array with Go

Answer 1

package main

import (
    "fmt"
)

func findSmallestMissingNumber(arr []int) int {
    numSet := make(map[int]bool)

    // Populate the set
    for _, num := range arr {
        numSet[num] = true
    }

    index := 1
    for {
        if !numSet[index] {
            return index
        }
        index++
    }
}

func main() {
    arr := []int{3, 4, -1, 1}
    
    fmt.Println(findSmallestMissingNumber(arr))
}



/*
run:

2

*/

 

70+ SQL courses for beginners and professionals