two_sum_2.go

package main

//Naive approach
func twoSumNaive(numbers []int, target int) []int {
	var toReturn = []int{}
	for i := 0; i < len(numbers); i++ {
		var current = numbers[i]
		var toFind = target - current
		for j := i + 1; j < len(numbers); j++ {
			if numbers[j] == toFind {
				toReturn = append(toReturn, i+1)
				toReturn = append(toReturn, j+1)
			} else if numbers[j] > toFind {
				break
			}
		}
	}
	return toReturn
}