class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        #有序-双指针
        l, r = 0, len(nums) - 1
        while l < r:
            if nums[l] + nums[r] == target:
                return [nums[l],nums[r]]
            elif nums[l] + nums[r] < target:
                l += 1
            else:
                r -= 1
        return []