-
Notifications
You must be signed in to change notification settings - Fork 0
/
traverse_two_list_node_test.go
119 lines (110 loc) · 2.77 KB
/
traverse_two_list_node_test.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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
package go_leetcode
import (
"reflect"
"testing"
)
type ListNode struct {
Val int
Next *ListNode
}
// 仅用于生成测试用例的Helper方法
func sliceToListNode(numbers []int) *ListNode {
dummyHead := new(ListNode)
current := dummyHead
for i := 0; i < len(numbers); i++ {
current.Next = &ListNode{numbers[i], nil}
current = current.Next
}
return dummyHead.Next
}
// 仅用于单元测试中验证返回值的Helper方法
func listNodeToSlice(listNode *ListNode) []int {
var numbers []int
for listNode != nil {
numbers = append(numbers, listNode.Val)
listNode = listNode.Next
}
return numbers
}
func TestHelperMethods(t *testing.T) {
result := sliceToListNode([]int{1, 2, 3})
if !reflect.DeepEqual(listNodeToSlice(result), []int{1, 2, 3}) {
t.Errorf("Wrong Answer")
}
}
// 12ms
func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
dummyHead := new(ListNode)
current := dummyHead
sumOrCarry := 0
for {
if l1 != nil && l2 != nil {
sumOrCarry = sumOrCarry + l1.Val + l2.Val
current.Next = &ListNode{sumOrCarry % 10, nil}
current = current.Next
sumOrCarry /= 10
l1, l2 = l1.Next, l2.Next
} else if l1 != nil && l2 == nil {
sumOrCarry = sumOrCarry + l1.Val
current.Next = &ListNode{sumOrCarry % 10, nil}
current = current.Next
sumOrCarry /= 10
l1 = l1.Next
} else if l1 == nil && l2 != nil {
sumOrCarry = sumOrCarry + l2.Val
current.Next = &ListNode{sumOrCarry % 10, nil}
current = current.Next
sumOrCarry /= 10
l2 = l2.Next
} else {
break
}
}
// 如果还有进位,应对testCase: [5],[5] => [0, 1]
if sumOrCarry > 0 {
current.Next = &ListNode{sumOrCarry, nil}
}
return dummyHead.Next
}
// 最佳答案,0ms的解答
/* 阅读收获
1. *ListNode指针类型不是一定要new(ListNode)的语句来初始化,可用listNode.Next = &ListNode{0,nil}来赋值
*/
func bestAnswer(l1 *ListNode, l2 *ListNode) *ListNode {
dummyHead := &ListNode{
Val: 0,
Next: nil,
}
current := dummyHead
sumOrCarry := 0
for l1 != nil || l2 != nil || sumOrCarry != 0 {
if l1 != nil {
sumOrCarry += l1.Val
l1 = l1.Next
}
if l2 != nil {
sumOrCarry += l2.Val
l2 = l2.Next
}
current.Next = &ListNode{Val: sumOrCarry % 10, Next: nil}
current = current.Next
sumOrCarry /= 10
}
return dummyHead.Next
}
func TestAddTwoNumbersTestCase2(t *testing.T) {
ln1 := sliceToListNode([]int{5})
ln2 := sliceToListNode([]int{5})
result := addTwoNumbers(ln1, ln2)
if !reflect.DeepEqual(listNodeToSlice(result), []int{0, 1}) {
t.Errorf("Wrong Answer")
}
}
func TestAddTwoNumbersTestCase1(t *testing.T) {
ln1 := sliceToListNode([]int{2, 4, 3})
ln2 := sliceToListNode([]int{5, 6, 4})
result := addTwoNumbers(ln1, ln2)
if !reflect.DeepEqual(listNodeToSlice(result), []int{7, 0, 8}) {
t.Errorf("Wrong Answer")
}
}