剑指offer_二分法_和为S的两个数字

和为S的两个数字

# -*- coding:utf-8 -*-
class Solution:
    def FindNumbersWithSum(self, array, tsum):
        # write code here
        product = float("inf")
        left = 0
        right = len(array)-1
        minleft = None
        minright = None
        while left < right:
            if array[left] + array[right] == tsum:
                if array[left] * array[right] < product:
                    product = array[left] * array[right]
                    minleft, minright = left, right
                left += 1
                right -= 1
            elif array[left] + array[right] < tsum:
                left += 1
            else:
                right -= 1
        if minleft or minright:
            return array[minleft], array[minright]
        else:
            return []         

#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param array int整型一维数组 
# @param sum int整型 
# @return int整型一维数组
#
class Solution:
    def FindNumbersWithSum(self , array: List[int], sum: int) -> List[int]:
        # write code here
        left = 0
        right = len(array)-1
        res = []
        while left < right:
            if array[left] + array[right] == sum:
                return [array[left], array[right]]
            elif array[left] + array[right] < sum:
                left += 1
            else:
                right -= 1
        return res