<qiyuangong>268_Missing_Number_3.py
def missingNumber( nums):
    nums.sort()
    left, right = 0, len(nums) - 1
    while left <= right:
        mid = (left + right) / 2
        if nums[mid] <= mid:
            left = mid + 1
        else:
            right = mid - 1
    return left
def sample_funcname ( var_0 ) :
    var_0.sort ( )
    var_3 , var_6 = 0 , len ( var_0 ) - 1
    while var_3 <= var_6 :
        var_8 = ( var_3 + var_6 ) / 2
        if var_0 [ var_8 ] <= var_8 :
            var_3 = var_8 + 1
        else :
            var_6 = var_8 - 1
    return var_3
