[Leetcode] 1. Two Sum

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:

        complements = {}
        for i, x in enumerate(nums):
            c = target - x
            
            if x in complements:
                return [complements[x], i]
                
            complements[c] = i
        
        return [-1, -1]