首页 > 其他 > 详细

Missing Number @leetcode

时间:2015-09-15 21:45:13      阅读:217      评论:0      收藏:0      [点我收藏+]

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

For example,
Given nums = [0, 1, 3] return 2.

class Solution(object):
    def missingNumber(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        n = len(nums)
        return (1+n)*n/2-sum(nums)

 

Missing Number @leetcode

原文:http://www.cnblogs.com/jkmiao/p/4811456.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!