-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsum.go
74 lines (63 loc) · 1.29 KB
/
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
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
package main
import (
"fmt"
)
type ListNode struct {
Val int
Next *ListNode
}
func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
resListNode := &ListNode{}
temp := 0
tempL1Node := l1
tempL2Node := l2
currNode := resListNode
for tempL1Node != nil || tempL2Node != nil {
t1 := 0
t2 := 0
if tempL1Node != nil {
t1 = tempL1Node.Val
}
if tempL2Node != nil {
t2 = tempL2Node.Val
}
// fmt.Println("t1,t2", tempL1Node.Val, tempL2Node.Val)
sum := t1 + t2
currNode.Val = sum%10 + temp
temp = sum / 10
currNode.Next = &ListNode{}
currNode = currNode.Next
if tempL1Node != nil {
fmt.Println("t1 not nil")
tempL1Node = tempL1Node.Next
}
if tempL2Node != nil {
fmt.Println("t2 not nil")
tempL2Node = tempL2Node.Next
}
}
return resListNode.Next
}
func twoSum(nums []int, target int) []int {
// resNum := make(map[int]int)
// result := make([]int, 0)
// for i := 0; i < len(nums); i++ {
// if nums[i] < target {
// temp := target - nums[i]
// if res[nums[i]] == 0 {
// res[temp] = 1
// } else {
// result = append(result, temp, nums[i])
// }
// }
// }
// return result
// res := make(map[int]int)
result := make([]int, 0)
// var temp int
for num := range nums {
nums = append(nums, num)
}
fmt.Println(nums)
return result
}