31 lines
561 B
Go
31 lines
561 B
Go
package top100liked
|
|
|
|
// https://leetcode.cn/problems/two-sum/description/?envType=study-plan-v2&envId=top-100-liked
|
|
|
|
func twoSum(nums []int, target int) []int {
|
|
for i, n := range nums {
|
|
t := target - n
|
|
for j, c := range nums[i+1:] {
|
|
if t == c {
|
|
return []int{i, i + j + 1}
|
|
}
|
|
}
|
|
}
|
|
|
|
return []int{}
|
|
}
|
|
|
|
// func twoSum(nums []int, target int) []int {
|
|
// map1 := make(map[int]int)
|
|
// for k, v := range nums {
|
|
// sub := target - v
|
|
// if iv, ok := map1[sub]; ok {
|
|
// return []int{iv, k}
|
|
// }
|
|
|
|
// map1[v] = k
|
|
// }
|
|
|
|
// return []int{}
|
|
// }
|