题目描述:
输入一个递增排序的数组和一个数字S,在数组中查找两个数,使得他们的和正好是S,如果有多对数字的和等于S,输出两个数的乘积最小的。
输出描述:
对应每个测试案例,输出两个数,小的先输出。
思路:
双指针l,r,一个头一个尾,如果array[l]+array[r]=tsum返回,如果小于目标值,l加一,如果大于r减一
代码:
class Solution:
def FindNumbersWithSum(self, array, tsum):
# write code here
res = []
l = 0
r = len(array) - 1
while l < r:
if array[l] + array[r] == tsum:
res = [array[l], array[r]]
break
elif array[l] + array[r] > tsum:
r -= 1
else:
l += 1
return res
举一反三:
如果要输出所有,且有重复,返回索引
例如:1,1,2,3,3,3,4,5,5
思路1:
第一遍遍历,将差值当作key,索引列表当作value存入字典
第二遍遍历,如果当前值存在于字典中,就将当前值对应的value和当前值的索引放入结果中,然后将target-当前值放入一个集合中,防止出现1,5和5,1这样的情况。
代码1:
a = [1, 1, 2, 3, 3, 3, 4, 5, 5]
s = 6
def f(numbers, target):
dic = {}
res = []
added = set()
for i in range(len(numbers)):
diff = target - numbers[i]
if diff not in dic:
dic[diff] = set([i])
else:
dic[diff].add(i)
for j in range(len(numbers)):
if numbers[j] in dic and numbers[j] not in added:
if numbers[j] not in dic[numbers[j]]:
for n in dic[numbers[j]]:
res.append([j, n])
else:
cur_l = list(dic[numbers[j]])
for ii in range(len(cur_l)):
for jj in range(ii + 1, len(cur_l)):
res.append([cur_l[ii], cur_l[jj]])
added.add(target - numbers[j])
return res
print(f(a, s))
# out:[[0, 8], [0, 7], [1, 8], [1, 7], [2, 6], [3, 4], [3, 5], [4, 5]]
思路2: