首页 > 代码库 > 1.Two Sum Leetcode Python
1.Two Sum Leetcode Python
Given an array of integers, find two numbers such that they add up to a specific target number.
The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.
You may assume that each input would have exactly one solution.
Input: numbers={2, 7, 11, 15}, target=9
The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.
You may assume that each input would have exactly one solution.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
这道题目来自于introduction to algorithm书上，介绍的是brute force的用法。
这里我们采用hashtable 将数值即为key value为index 将target-num[index]作为搜索条件。 类似的题目还有4 sum
代码如下：
class Solution:
# @return a tuple, (index1, index2)
def twoSum(self, num, target):
process={}
for index in range(len(num)):
if target-num[index] in process:
return [process[target-num[index]]+1,index+1]
process[num[index]]=index1.Two Sum Leetcode Python
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。