Files
LeetCode/0001-two-sum/solution.py
Simon Oberzier 293fee1fc5 Problem 1 and 2
2026-01-08 21:34:54 +01:00

9 lines
274 B
Python

class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:
dic = {}
for i, val in enumerate(nums):
if target - val in dic:
return [dic[target - val], i]
else:
dic[val] = i