-
Notifications
You must be signed in to change notification settings - Fork 20
/
Copy pathsolution_test.go
76 lines (67 loc) · 1.31 KB
/
solution_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
package leetcode
import (
"fmt"
"testing"
)
func TestDeleteDuplicates(t *testing.T) {
t.Run("Test-1", func(t *testing.T) {
data1 := []int{1, 1, 2}
got := deleteDuplicates(MakeListNote(data1))
want := MakeListNote([]int{1, 2})
if !Equal(got, want) {
fmt.Print("GOT:")
PrintList(got)
fmt.Print("WANT:")
PrintList(want)
t.Error("GOT:", got, "WANT:", want)
}
})
t.Run("Test-2", func(t *testing.T) {
got := deleteDuplicates(&ListNode{})
want := &ListNode{}
if !Equal(got, want) {
fmt.Print("GOT:")
PrintList(got)
fmt.Print("WANT:")
PrintList(want)
t.Error("GOT:", got, "WANT:", want)
}
})
}
func Equal(x, y *ListNode) bool {
for x == nil || y == nil {
if x == nil && y != nil {
fmt.Println(x, y)
return false
}
if x != nil && y == nil {
fmt.Println(x, y)
return false
}
if x.Val != y.Val {
fmt.Println(x, y)
return false
}
x = x.Next
y = y.Next
}
return true
}
func PrintList(x *ListNode) {
for x != nil {
fmt.Print(x.Val, " ")
x = x.Next
}
fmt.Println()
}
func MakeListNote(x []int) *ListNode {
list := &ListNode{}
head := list
list.Val = x[0]
for i := 1; i < len(x); i++ {
list.Next = &ListNode{}
list = list.Next
list.Val = x[i]
}
return head
}