Missing Number
Given an array containing n distinct numbers taken from 0, 1, 2, …, n, find the one that is missing from the array.
Example
Input: [3,0,1]
Output: 2
Note
Your algorithm should run in linear runtime complexity. Could you implement it using only constant extra space complexity?
class Solution(object):
def missingNumber(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
res = len(nums)
for i in range(len(nums)):
res ^= (i ^ nums[i])
return res