Leetcode 1. Two Sum

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.

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

 

Python3 解答

class Solution:
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        # 先判断target 是否为None
        if target == None:
            return False


        #判断 nums 的长度是否小于等于1
        if len(nums) <= 1:
            return False
        
        #用一个字典，保存nums中值与其索引的对应关系
        inds = {}
        
        for i in range(0, len(nums)):
            

            #判断 target和nums的差值，是否在inds中有记录
            if ( target - nums[i] ) in inds.keys():
                i1 = i
                i2 = inds[target - nums[i]]
                return [i1, i2]

	    #如果该target-nums[i]的值，没有在inds中找到，那么将nums[i]保存到inds中
            else:
                inds[nums[i]] = i