Update: not use dot imports

Author: openset

problems/add-one-row-to-tree/add_one_row_to_tree.go

@@ -2,6 +2,7 @@ package problem623
 
 import "github.com/openset/leetcode/internal/kit"
 
+// TreeNode - Definition for a binary tree node.
 type TreeNode = kit.TreeNode
 
 /**

problems/add-two-numbers-ii/add_two_numbers_ii.go

@@ -2,6 +2,7 @@ package problem445
 
 import "github.com/openset/leetcode/internal/kit"
 
+// ListNode - Definition for singly-linked list.
 type ListNode = kit.ListNode
 
 /**

problems/add-two-numbers/add_two_numbers.go

@@ -2,6 +2,7 @@ package problem2
 
 import "github.com/openset/leetcode/internal/kit"
 
+// ListNode - Definition for singly-linked list.
 type ListNode = kit.ListNode
 
 /**

problems/balanced-binary-tree/balanced_binary_tree.go

@@ -2,6 +2,7 @@ package problem110
 
 import "github.com/openset/leetcode/internal/kit"
 
+// TreeNode - Definition for a binary tree node.
 type TreeNode = kit.TreeNode
 
 /**

problems/construct-string-from-binary-tree/construct_string_from_binary_tree.go

@@ -3,9 +3,12 @@ package problem606
 import (
 	"strconv"
 
-	. "github.com/openset/leetcode/internal/kit"
+	"github.com/openset/leetcode/internal/kit"
 )
 
+// TreeNode - Definition for a binary tree node.
+type TreeNode = kit.TreeNode
+
 /**
  * Definition for a binary tree node.
  * type TreeNode struct {

problems/construct-string-from-binary-tree/construct_string_from_binary_tree_test.go

@@ -3,7 +3,7 @@ package problem606
 import (
 	"testing"
 
-	. "github.com/openset/leetcode/internal/kit"
+	"github.com/openset/leetcode/internal/kit"
 )
 
 type caseType struct {
@@ -18,12 +18,12 @@ func TestTree2str(t *testing.T) {
 			expected: "1(2(4))(3)",
 		},
 		{
-			input:    []int{1, 2, 3, NULL, 4},
+			input:    []int{1, 2, 3, kit.NULL, 4},
 			expected: "1(2()(4))(3)",
 		},
 	}
 	for _, tc := range tests {
-		output := tree2str(SliceInt2TreeNode(tc.input))
+		output := tree2str(kit.SliceInt2TreeNode(tc.input))
 		if output != tc.expected {
 			t.Fatalf("input: %v, output: %v, expected: %v", tc.input, output, tc.expected)
 		}

problems/convert-sorted-array-to-binary-search-tree/convert_sorted_array_to_binary_search_tree.go

@@ -2,6 +2,7 @@ package problem108
 
 import "github.com/openset/leetcode/internal/kit"
 
+// TreeNode - Definition for a binary tree node.
 type TreeNode = kit.TreeNode
 
 /**

problems/cousins-in-binary-tree/cousins_in_binary_tree.go

@@ -1,6 +1,9 @@
 package problem993
 
-import . "github.com/openset/leetcode/internal/kit"
+import "github.com/openset/leetcode/internal/kit"
+
+// TreeNode - Definition for a binary tree node.
+type TreeNode = kit.TreeNode
 
 /**
  * Definition for a binary tree node.

problems/cousins-in-binary-tree/cousins_in_binary_tree_test.go

@@ -3,7 +3,7 @@ package problem993
 import (
 	"testing"
 
-	. "github.com/openset/leetcode/internal/kit"
+	"github.com/openset/leetcode/internal/kit"
 )
 
 type caseType struct {
@@ -22,32 +22,32 @@ func TestIsCousins(t *testing.T) {
 			expected: false,
 		},
 		{
-			input:    []int{1, 2, 3, NULL, 4, NULL, 5},
+			input:    []int{1, 2, 3, kit.NULL, 4, kit.NULL, 5},
 			x:        5,
 			y:        4,
 			expected: true,
 		},
 		{
-			input:    []int{1, 2, 3, NULL, 4},
+			input:    []int{1, 2, 3, kit.NULL, 4},
 			x:        2,
 			y:        3,
 			expected: false,
 		},
 		{
-			input:    []int{1, 2, 3, NULL, 4, 5},
+			input:    []int{1, 2, 3, kit.NULL, 4, 5},
 			x:        4,
 			y:        5,
 			expected: true,
 		},
 		{
-			input:    []int{1, 2, 3, NULL, 4, 5},
+			input:    []int{1, 2, 3, kit.NULL, 4, 5},
 			x:        5,
 			y:        4,
 			expected: true,
 		},
 	}
 	for _, tc := range tests {
-		output := isCousins(SliceInt2TreeNode(tc.input), tc.x, tc.y)
+		output := isCousins(kit.SliceInt2TreeNode(tc.input), tc.x, tc.y)
 		if output != tc.expected {
 			t.Fatalf("input: %v, output: %v, expected: %v", tc.input, output, tc.expected)
 		}

problems/delete-node-in-a-linked-list/delete_node_in_a_linked_list.go

@@ -1,6 +1,9 @@
 package problem237
 
-import . "github.com/openset/leetcode/internal/kit"
+import "github.com/openset/leetcode/internal/kit"
+
+// ListNode - Definition for singly-linked list.
+type ListNode = kit.ListNode
 
 /**
  * Definition for singly-linked list.