Leetcode-k数之和（python）

1. 二数之和 

解法一：

class Solution(object):
    def twoSum(self, nums, target):
        #下面解法复杂度O(n)~O(n^2),不是最优，最优hashmap
        nlen=len(nums)
        if nlen==0:
            return []
        for x in nums:
            index_1=nums.index(x)
            for j in range(index_1+1,len(nums)):
                if x+nums[j]==target:
                    return [index_1,j]
                    break       

解法二：

class Solution(object):
    def twoSum(self, nums, target):
        #hashmap
        dic={}
        for index,x in enumerate(nums):
            y=target-x
            if y in dic:
                print(dic[y])
                return [dic[y],index]
            else:
                dic[x]=index