Files
leetcode/1. Two Sum/solution.py
2026-01-28 15:56:45 +03:00

11 lines
283 B
Python

class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:
d: dict = {}
for i in range(len(nums)):
if (target - nums[i]) in d.keys():
return [i, d[target - nums[i]]]
else:
d[nums[i]] = i