Leetcode-1-两数之和

【英】Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solution, and you may not use the same element twice.
Example: Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1].
【中】给定一个整数数组 nums 和一个目标值 target，请你在该数组中找出和为目标值的那 两个 整数，并返回他们的数组下标。
你可以假设每种输入只会对应一个答案。但是，你不能重复利用这个数组中同样的元素。
示例:
给定 nums = [2, 7, 11, 15], target = 9；因为 nums[0] + nums[1] = 2 + 7 = 9
所以返回 [0, 1]

解法一：Python暴力解【O(n^2)】：

class Solution(object):
    def twoSum(self, nums, target):
        for i in range(len(nums)):   #直接两个指针遍历循环
            for j in range(i+1,len(nums)):
                if nums[i]+nums[j] == target:   #和相同即输出
                    return [i,j]
                

Or

class Solution(object):
    def twoSum(self, nums, target):
        for i in range(len(nums)):
            x = target-nums[i]
            for j in range(i+1,len(nums)):
                if x == nums[j]:
                    return [i,j]

解法二：字典法，利用Python中的字典
(参考https://blog.csdn.net/wangjikun123/article/details/80035527)

class Solution(object):
    def twoSum(self, nums, target):
        d = {}
        size = 0
        while size < len(nums):
            if target-nums[size] in d:
                if d[target-nums[size]] < size:
                    return [size,d[target-nums[size]]]
            else:
                d[nums[size]] = size
            size = size + 1

效果对比：

暴力解法耗时高