-
Notifications
You must be signed in to change notification settings - Fork 0
/
two_sum.go
40 lines (38 loc) · 915 Bytes
/
two_sum.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
// Package two_sum
//
// Given an array of integers nums and an integer target,
// return indices of the two numbers such that they add up to target.
//
// You may assume that each input would have exactly one solution, and you may not use the same element twice.
//
// You can return the answer in any order.
package two_sum
// bruteForce
//
// Just iterates over the numbers for each number, looking for a perfect match
func bruteForce(nums []int, target int) []int {
for k, v := range nums {
for k1, v1 := range nums {
if k1 == k {
continue
}
if v1+v == target {
return []int{k, k1}
}
}
}
return []int{}
}
// withoutCurrentK
//
// Iterates over the numbers k1 > k , for each number k
func withoutCurrentK(nums []int, target int) []int {
for k, v := range nums {
for k1, v1 := range nums[k+1:] {
if v1+v == target {
return []int{k, k + k1 + 1}
}
}
}
return []int{}
}