268. missing-number, golang

最新推荐文章于 2022-08-03 14:04:15 发布

sky527759

最新推荐文章于 2022-08-03 14:04:15 发布

阅读量98

点赞数

分类专栏： leetcode-myself

本文链接：https://blog.csdn.net/sky527759/article/details/103746547

版权

leetcode-myself 专栏收录该内容

22 篇文章 0 订阅

订阅专栏

description:

Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, 
find the one that is missing from the array.

Example 1:
Input: [3,0,1]
Output: 2

Example 2:
Input: [9,6,4,2,3,5,7,0,1]
Output: 8

Note:
Your algorithm should run in linear runtime complexity. 
Could you implement it using only constant extra space complexity?

code:

func missingNumber(nums []int) int {
    nLen := len(nums)
    if 0 == nLen {
        return 0
    }
    
    nRet := nLen * (nLen + 1) / 2 //(first + end) * num / 2
    for _, v := range nums {
        nRet -= v
    }
    
    return nRet
}//func missingNumber(nums []int) int