刷题 Two Sum

版权声明：https://blog.csdn.net/CAIYUNFREEDOM https://blog.csdn.net/CAIYUNFREEDOM/article/details/90514035

https://leetcode.com/problems/two-sum/

1. Two Sum

Easy

10738358FavoriteShare

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].

class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        d = {}
        i=0
        for e in nums:
        	if d.has_key(e) and d.has_key(target-e):
        	  return list([i,d[target-e] ])	
        	else:
        	  d[e]=i
        	  i+=1

        for key in d.keys():
          if(d.has_key(target-key)):
              return list([d[key],d[target-key]])	
        return []