g0001_0100.s0001_two_sum.solution.ts 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)
// #2023_09_28_Time_54_ms_(91.72%)_Space_45.5_MB_(22.26%)

function twoSum(nums: number[], target: number): number[] {
    const indexMap: Map = new Map()
    for (let i = 0; i < nums.length; i++) {
        const requiredNum: number = target - nums[i]
        if (indexMap.has(requiredNum)) {
            return [indexMap.get(requiredNum)!, i]
        }
        indexMap.set(nums[i], i)
    }
    return [-1, -1]
}

export { twoSum }