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].
解题思路:
遍历数组nums,先用一个循环遍历nums代表操作数1,再用一个循环遍历nums代表操作数2,比较和与target大小,若相等则返回结果。
代码:
class Solution: def twoSum(self, nums, target): """ :type nums: List[int] :type target: int :rtype: List[int] """ for i in range(0, len(nums)): for j in range(i + 1, len(nums)): if(i != j and nums[i] + nums[j] == target): return [i, j]