Function twoSum

two_sum_1/solution.go:4–22

twoSum does not assume that nums is sorted.

(nums []int, target int)

// twoSum does not assume that nums is sorted.
func twoSum(nums []int, target int) []int {
	numsLen := len(nums)
	if numsLen < 2 {
		return []int{}
	}

	numToIndex := make(map[int]int)
	for idx, num := range nums {
		need := target - num
		mIdx, ok := numToIndex[need]
		if ok {
			return []int{mIdx, idx}
		}

		numToIndex[num] = idx
	}

	return []int{}
}

// twoSumSortedInput assumes that nums is sorted.
func twoSumSortedInput(nums []int, target int) []int {