Leetcode_Missing Number

Tag:Array,Math,Bit Manipulation
Difficulty: Easy
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.
Note:
Your algorithm should run in linear runtime complexity. Could you implement it using only constant extra space complexity?
Array

class Solution(object):
    def missingNumber(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        nums.append(None)
        for i in range(len(nums)):
            while(nums[i]>=0 and nums[nums[i]]!=nums[i]):
                tmp = nums[nums[i]]
                nums[nums[i]] = nums[i]
                nums[i] =tmp
        for i in range(len(nums)):
            if nums[i]==None:
                return i

Bit Manipulation
思路是既然0到n之间少了一个数，我们将这个少了一个数的数组合0到n之间完整的数组异或一下，那么相同的数字都变为0了，剩下的就是少了的那个数字了

class Solution(object):
    def missingNumber(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        ret=0
        for i in range(len(nums)):
            ret = ret ^ (i+1) ^nums[i]
        return ret

Math

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