Leetcode之两数之和

题目：

给定一个整数数组 nums 和一个目标值 target，请你在该数组中找出和为目标值的那 两个 整数，并返回他们的数组下标。

你可以假设每种输入只会对应一个答案。但是，你不能重复利用这个数组中同样的元素。

示例:

给定 nums = [2, 7, 11, 15], target = 9

因为 nums[0] + nums[1] = 2 + 7 = 9
所以返回 [0, 1]

方法一：利用list遍历循环

def getSumIndex(list, target):
    for num1 in list:
        num2 = target - num1
        if num2 in list:
            index1 = list.index(num1)
            index2 = list.index(num2)
            return [index1, index2]
    return [None, None]

方法二：利用list遍历循环，在方法一基础上改进

def getSumIndex2(nums, target):
    for num1 in nums:
        num2 = target - num1
        index1 = nums.index(num1)
        temp = nums[:index1]
        if num2 in temp:
            index2 = temp.index(num2)
            return [index2, index1]
    return [None, None]

方法三：利用list和dict遍历和词典匹配

import collections
def getSumIndexByDict(nums, target):
    # dictData = collections.OrderedDict()  #有序词典
    dictData = {}
    for index, num in enumerate(nums):
        dictData[num] = index

    for index, num in enumerate(nums):
        num2 = target -num
        index2 = dictData.get(num2)
        if index2 is not None and index2 != index:
            print(num, num2)
            return [index, index2]
    return [None, None]

测试代码：

import time
if __name__ == '__main__':
    nums = [2, 7, 11, 15, 8, 10]
    target = 13

    time1 = time.clock()
    result1 = getSumIndex(nums, target)
    time2 = time.clock()

    result2 = getSumIndex2(nums, target)
    time3 = time.clock()

    result3 = getSumIndexByDict(nums,target)
    time4 = time.clock()

    print('result1:', result1,  'time:' , (time2-time1))
    print('result2:', result2, 'time:', (time3 - time2))
    print('result3:', result3, 'time:', (time4 - time3))


#测试结果如下：
result1: [0, 2] time: 2.719999999999806e-05
result2: [0, 2] time: 1.3699999999998436e-05
result3: [0, 2] time: 1.4300000000001811e-05