Files
leetcode/easy/1 Two Sum/solution.py
T
2023-11-22 11:52:21 -05:00

19 lines
603 B
Python

from typing import List
class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:
for i in range(len(nums)):
for j in range(i + 1, len(nums)):
if nums[i] + nums[j] == target:
return [i, j]
def twoSum_better(self, nums: List[int], target: int) -> List[int]:
num_dict = {}
for i in range(len(nums)):
complement = target - nums[i]
if complement in num_dict:
return [num_dict[complement], i]
else:
num_dict[nums[i]] = i
return []