LeetCode/Grind169

1. Two Sum

hyunkookim 2025. 4. 22. 01:32

1. Two Sum

 

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        pair = {} # value: idx
        for i, num in enumerate(nums):
            diff = target-num
                    
            if diff in pair: # i != pair[diff] 이 조건은 항상 참임
                return [pair[diff], i] # 작은 index 가 앞으로.
            
            pair[num] = i