human
Give me a Python code to find the one that is missing from the array given the following:
Solve in Python:
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?
assistant
#Here is Python code to find the one that is missing from the array.

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