improve-constructions-coverage

Author: plh97

construction/listnode/listnode.go

@@ -10,9 +10,8 @@ type ListNode struct {
 // MakeListNode 将连续结构的数组转化成 -> 单链结构数据的 -> 取址
 func MakeListNode(is []int) *ListNode {
 	if len(is) == 0 {
-		return nil
+		return &ListNode{}
 	}
-
 	res := &ListNode{
 		Val: is[0],
 	}

construction/listnode/listnode_test.go

@@ -48,12 +48,46 @@ func Test_OK(t *testing.T) {
 				one: MakeListNode([]int{1, 6, 4}),
 			},
 		},
-	};
+		question{
+			p: para{
+				one: MakeListNode([]int{1, 6}),
+			},
+			a: ans{
+				one: MakeListNode([]int{1, 6}),
+			},
+		},
+		question{
+			p: para{
+				one: MakeListNode([]int{1}),
+			},
+			a: ans{
+				one: MakeListNode([]int{1}),
+			},
+		},
+		question{
+			p: para{
+				one: MakeListNode([]int{}),
+			},
+			a: ans{
+				one: &ListNode{},
+			},
+		},
+	}
 
 	for _, q := range qs {
 		a, p := q.a, q.p
-		ast.Equal(a.one.Val, p.one.Val, "输入:%v", p)
-		ast.Equal(a.one.Next.Val, p.one.Next.Val, "输入:%v", p)
-		ast.Equal(a.one.Next.Next.Val, p.one.Next.Next.Val, "输入:%v", p)
+		if a.one != nil {
+			ast.Equal(a.one.Val, p.one.Val, "输入:%v", p)
+		} else {
+			ast.Equal(nil, p.one, "输入:%v", p)
+			ast.Equal(nil, a.one, "输入:%v", p)
+		}
+		if a.one != nil && a.one.Next != nil {
+			ast.Equal(a.one.Next.Val, p.one.Next.Val, "输入:%v", p)
+		}
+		if a.one != nil && a.one.Next != nil && a.one.Next.Next != nil {
+			ast.Equal(a.one.Next.Next.Val, p.one.Next.Next.Val, "输入:%v", p)
+		}
+
 	}
 }

coverage.txt

@@ -157,10 +157,10 @@ www/leetcode/5.LongestPalindromicSubstring/main.go:6.29,8.5 1 7
 www/leetcode/5.LongestPalindromicSubstring/main.go:10.8,12.33 1 11
 www/leetcode/5.LongestPalindromicSubstring/main.go:12.33,13.29 1 4
 www/leetcode/5.LongestPalindromicSubstring/main.go:13.29,15.5 1 2
-www/leetcode/5.LongestPalindromicSubstring/main.go:21.41,22.16 1 2
+www/leetcode/5.LongestPalindromicSubstring/main.go:21.41,22.16 1 3
 www/leetcode/5.LongestPalindromicSubstring/main.go:25.2,26.30 2 2
 www/leetcode/5.LongestPalindromicSubstring/main.go:35.2,35.19 1 2
-www/leetcode/5.LongestPalindromicSubstring/main.go:22.16,24.3 1 0
+www/leetcode/5.LongestPalindromicSubstring/main.go:22.16,24.3 1 1
 www/leetcode/5.LongestPalindromicSubstring/main.go:26.30,27.36 1 7
 www/leetcode/5.LongestPalindromicSubstring/main.go:27.36,30.35 2 18
 www/leetcode/5.LongestPalindromicSubstring/main.go:30.35,32.5 1 3
@@ -235,8 +235,8 @@ www/leetcode/IBM/3.重复的字符串个数/main.go:3.38,5.19 2 1
 www/leetcode/IBM/3.重复的字符串个数/main.go:8.2,8.12 1 1
 www/leetcode/IBM/3.重复的字符串个数/main.go:5.19,7.3 1 8
 mode: atomic
-www/leetcode/construction/listnode/listnode.go:11.39,12.18 1 6
-www/leetcode/construction/listnode/listnode.go:16.2,21.31 3 6
-www/leetcode/construction/listnode/listnode.go:26.2,26.12 1 6
-www/leetcode/construction/listnode/listnode.go:12.18,14.3 1 0
-www/leetcode/construction/listnode/listnode.go:21.31,24.3 2 18
+www/leetcode/construction/listnode/listnode.go:11.39,12.18 1 11
+www/leetcode/construction/listnode/listnode.go:15.2,20.31 3 10
+www/leetcode/construction/listnode/listnode.go:25.2,25.12 1 10
+www/leetcode/construction/listnode/listnode.go:12.18,14.3 1 1
+www/leetcode/construction/listnode/listnode.go:20.31,23.3 2 20