Leetcode 1: Two Sum

题目：

python3代码：

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        nums = [(num, idx) for idx, num in enumerate(nums)]
        nums.sort(key=lambda x: x[0])
        left, right = 0, len(nums) - 1
        while left < right:
            if nums[left][0] + nums[right][0] == target:
                return [nums[left][1], nums[right][1]]
            elif nums[left][0] + nums[right][0] < target:
                left += 1
            elif nums[left][0] + nums[right][0] > target:
                right -= 1 

另外一种写法：

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        i = 0
        j = len(nums) - 1
        sortedNums = sorted(zip(nums, range(len(nums))))
        while i < j:
            if sortedNums[i][0] + sortedNums[j][0] == target:
                return [sortedNums[i][1], sortedNums[j][1]]
            elif sortedNums[i][0] + sortedNums[j][0] < target:
                i += 1
            elif sortedNums[i][0] + sortedNums[j][0] > target:
                j -= 1

如果觉得不错，就点赞关注留言吧~
谢谢~