本文共 772 字,大约阅读时间需要 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.
Example:
Given nums = [2, 7, 11, 15], target = 9,Because nums[0] + nums[1] = 2 + 7 = 9,return [0, 1].
思路:两个数的和一定(target),如果一个其中一个数字固定,那另一个数字也就固定了。
所以我用for循环,每次先固定一个数,再用index方法寻找另一个。(不能重复)
class Solution(object): def twoSum(self, nums, target): """ :type nums: List[int] :type target: int :rtype: List[int] """ for i,val in enumerate(nums): retarget = target - val if retarget in nums and nums.index(retarget) != i: j = nums.index(retarget) return [i,j]
转载地址:http://hjrbb.baihongyu.com/