Method _twoSum

Array/two_sum.py:58–76

:type nums: List[int] :type target: int :rtype: List[int]

(self, nums, target)

        
    
    def _twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """

        sortedNums = sorted(nums)
        start = 0
        end = len(sortedNums) - 1
        while start <= end:
            # print(nums[start] + nums[end])
            if sortedNums[start] + sortedNums[end] == target:
                return sortedNums[start], sortedNums[end]
            
            if sortedNums[start] + sortedNums[end] > target:
                end -= 1
            else:
                start += 1
                
    # def binarySearch(self, rawList, target):
    #     split = len(rawList) // 2