g0001_0100.s0001_two_sum.Solution.py Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-all Show documentation

104 LeetCode algorithm problem solutions

There is a newer version: 1.8

# #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table
# #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Big_O_Time_O(n)_Space_O(n)
# #2024_06_06_Time_62_ms_(53.52%)_Space_17.8_MB_(37.79%)

class Solution:
    def twoSum(self, numbers: List[int], target: int) -> List[int]:
        index_map = {}
        for i, num in enumerate(numbers):
            required_num = target - num
            if required_num in index_map:
                return [index_map[required_num], i]
            index_map[num] = i
        return [-1, -1]