open:leetcode-two-sum

snippet.python
class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        for idx, num in enumerate(nums):
            if target - num in nums:
                return idx, nums.index(target-num)

  • open/leetcode-two-sum.txt
  • 마지막으로 수정됨: 2020/06/02 09:25
  • 저자 127.0.0.1