-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path445.AddTwoNumbersII.go
More file actions
57 lines (53 loc) · 1.44 KB
/
445.AddTwoNumbersII.go
File metadata and controls
57 lines (53 loc) · 1.44 KB
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
/**
* Definition for singly-linked list.
* type ListNode struct {
* Val int
* Next *ListNode
* }
*/
func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
newNode := &ListNode{}
vec1 := make([]int, 0)
vec2 := make([]int, 0)
for l1!=nil {
vec1 = append(vec1, l1.Val)
l1 = l1.Next
}
for l2!= nil {
vec2 = append(vec2, l2.Val)
l2 = l2.Next
}
overflow := 0
pos1:=len(vec1)-1
pos2:=len(vec2)-1
for pos1 >= 0 || pos2 >= 0 {
val1 := 0
if pos1>=0 {
val1 = vec1[pos1]
}
val2 := 0
if pos2 >= 0 {
val2 = vec2[pos2]
}
val := val1 + val2 + overflow
if val > 9 {
overflow = 1
val -= 10
} else {
overflow = 0
}
newNode.Val = val
tmpNode := &ListNode{
Next: newNode,
}
newNode = tmpNode
pos1--
pos2--
}
if overflow == 1 {
newNode.Val = 1
return newNode
} else {
return newNode.Next
}
}