g0001_0100.s0001_two_sum.solution.go 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

package s0001_two_sum

// #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_01_28_Time_3_ms_(93.85%)_Space_4.2_MB_(58.64%)

func twoSum(nums []int, target int) []int {
	indexMap := make(map[int]int)
	for i, num := range nums {
		requiredNum := target - num
		if j, ok := indexMap[requiredNum]; ok {
			return []int{j, i}
		}
		indexMap[num] = i
	}
	return []int{-1, -1}
}