"""268. Missing Number
Easy

1413

1809

Add to List

Share
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?

Accepted
391,377
Submissions
776,247"""


def missingNumber(nums):
    my_max = max(nums)
    for i in range(my_max):
        if i not in nums:
            return i
    return my_max + 1