# ************************************************
# 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(object):
def TwoSum(self, nums, target):
d = {}
for i,num in enumerate(nums):
if target - num in d:
return [d[target-num], i]
d[num]=i
"""
:nums : list[int]
:target : int
"""
TwoSum——python
最新推荐文章于 2024-08-22 21:56:30 发布