"""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]."""from __future__ import print_functiondef twoSum(nums, target):""":type nums: List[int]:type target: int:rtype: List[int]"""chk_map = {}for index, val in enumerate(nums):compl = target - valif compl in chk_map:indices = [chk_map[compl], index]print(indices)return [indices]else:chk_map[val] = indexreturn False
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。