题目:
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:
def twoSum(self, nums, target):
sum = []
for i in range(len(nums)):
for j in range(i + 1, len(nums)):
if nums[i] + nums[j] == target:
sum.append(i)
sum.append(j)
return sum
else:
continue
return sum