# 算法数组内数相加等于某一个数

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 + nums = 2 + 7 = 9,
return [0, 1].

var = dict((nums[i], i) for i in range(len(nums)))
for i in range(len(nums)):
num2 = target-nums[i]
if num2 in var and not i == var[num2]:
return [i,var[num2]]
####################
class Solution:

def twoSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""

recs = dict((num, i) for i, num in enumerate(nums))

for i, num in enumerate(nums):
j = recs.get(target - num)
if j and not j == i:
return [i, j]

01-11 2120                                                                          07-29 1万+
06-04 5722
02-05 1万+
04-08 3204
01-29 35
04-21 3715
10-10 833
11-25 32
03-09 1019
11-14 5507
08-03 218
03-11 660
09-27 2055
03-15 371
©️2020 CSDN 皮肤主题: 技术工厂 设计师:CSDN官方博客