LeetCode_35 Two Sum

题目描述:

1
2
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.

输入样例:

1
2
3
4
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

解法一:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
def twoSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype
for i in range(len(nums)):
num_find = target - nums[i]
try:
index_find = nums.index(num_find)
if index_find != i:
return [i, index_find]
else:
pass
except:
pass

解法二:

1
2
3
4
5
6
7
8
9
10
def twoSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype
tmp = {}
for i in range(len(nums)):
if target - nums[i] in tmp:
return [i, tmp[target-nums[i]]]
tmp[nums[i]] = i