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?
# -*- coding:utf-8 -*-
__author__ = 'yangxin_ryan'
"""
Solutions:
1.先计算最大值到最小值的和;
2.再计算输入数据的和;
3.再计算两个和的差,就是缺少的值;
"""
class MissingNumber(object):
def missingNumber(self, nums):