1、剑指offer.和为S的两个数:输入一个递增排序的数组和一个数字S,在数组中查找两个数,使得他们的和正好是S,如果有多对数字的和等于S,输出两个数的乘积最小的。
#时间复杂度O(n)
class Solution:
def FindNumbersWithSum(self, array, tsum):
left = 0
right = len(array) - 1
res = []
ret = []
while left < right:
if array[left] + array[right] == tsum:
res.append([array[left], array[right]])
left += 1
right -= 1
elif array[left] + array[right] < tsum:
left += 1
else:
right -= 1
if res == []:
return []
else:
for i in res:
ret.append(i[0]*i[1])
pos = ret.index(min(ret))
return res[pos]
leetcode1.Two Sum
class Solution:
def twoSum(self, nums, target):
dict ={}
for i in range(len(nums)):
if nums[i] in dict:
return [dict[nums[i]],i]
else:
dict[target-nums[i]] = i
上两个题总结:找和为定值的两个数,若无序则用字典时间复杂度O(n)空间复杂度O(n),有序用前后指针O(n)空间复杂度O(1)