Solution

My Solution

func findDisappearedNumbers(nums []int) []int {
    arr := make([]bool, len(nums))

    for _, num :=range nums {
        arr[num-1] = true
    }

    idx := 0
    for i, b := range arr {
        if !b {
            nums[idx] = i+1
            idx++
        }
    }

    return nums[:idx]
}

448. Find All Numbers Disappeared in an Array

🟩 Easy

Solution

My Solution

func findDisappearedNumbers(nums []int) []int {
    arr := make([]bool, len(nums))

    for _, num :=range nums {
        arr[num-1] = true
    }

    idx := 0
    for i, b := range arr {
        if !b {
            nums[idx] = i+1
            idx++
        }
    }

    return nums[:idx]
}

Leetcode:

Previous445. Add Two Numbers II Next459. Repeated Substring Pattern

Last updated 3 months ago

Was this helpful?