Leetcode - 268. Missing Number

Leetcode - 268. Missing Number

• Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.

Solution

func missingNumber(nums []int) int {
    ln := len(nums)
    sumTotal := (ln*(ln+1))/2
    numSum := 0

    for _, num := range nums{
        numSum+=num
    }
    return sumTotal-numSum
}