两项之和
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].
1.普通方法python实现
def sum_1(L,Target):
ll=len(L)
for i in range(ll):
a=Target-L[i]
b=0
for x in range(i+1,ll+1):
if L[x]==a:
b=x
return [i,b]
return 0
print(sum_1([2,7,11,15],9))
小结:暴搜时间时间复杂度为O(n*n)
2.利用字典实现快速求和查找
class Solution(object):
def twoSum(self, nums, target):
complement_dict={}
a=len(nums)
for i in range(a):
complement=target-nums[i]
if complement in complement_dict:
return [complement_dict[complement],i]
else:
if nums[i] in complement_dict:
continue
complement_dict[nums[i]]=i
总结:
采用python中字典(散列表)按键快速查找的方法,提高检索速度
步骤:
1.创建一个空的词典complement_dict={},其中将nums索引号对应的值赋给键key,将索引号赋值给值value。
2.遍历数组nums中数值nums[i],将要寻找的值Target-nums[i]赋值给complement,在字典complement_dict={}里寻找是否有键值complement。
3.若存在键值complement,则返回一个数组,数组元素为键complement的value(即target-nums[i]在nums中的索引)和循环到的索引值i。
4.若未找到键值complement,则判断nums[i]是否在字典complement_dict内,若不在创建键nums[i],对应值赋值为索引i,继续执行循环。