剑指offer-和为S的两个数字之python实现

class Solution:
    def FindNumbersWithSum(self, array, tsum):
        if len(array) == 0:                                 
            return []                                       
        if len(array) == 1:                                 
            if array[0] == tsum:                            
                return [[tsum]]                             
        left, right = 0, len(array) - 1                     
        total = array[0] + array[-1]                        
        res = []                                                                                      
        while left < right and array[left] < int(tsum/2):
            if total > tsum:                                
                right -= 1                                  
            elif total < tsum:                              
                left += 1                                   
            else:                                           
                res.append(array[left])                    
                res.append(array[right])                                            
                break
            total = array[left] + array[right]
        return res