Files
LeetCode_tasks/solutions/lc1.py
2026-05-25 12:29:20 +05:00

10 lines
259 B
Python

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