Skip to content

Commit 19139fe

Browse files
author
openset
committed
Update: not use dot imports
1 parent 2cdd5ac commit 19139fe

File tree

40 files changed

+131
-79
lines changed

40 files changed

+131
-79
lines changed

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

+1
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,7 @@ package problem623
22

33
import "github.com/openset/leetcode/internal/kit"
44

5+
// TreeNode - Definition for a binary tree node.
56
type TreeNode = kit.TreeNode
67

78
/**

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

+1
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,7 @@ package problem445
22

33
import "github.com/openset/leetcode/internal/kit"
44

5+
// ListNode - Definition for singly-linked list.
56
type ListNode = kit.ListNode
67

78
/**

‎problems/add-two-numbers/add_two_numbers.go

+1
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,7 @@ package problem2
22

33
import "github.com/openset/leetcode/internal/kit"
44

5+
// ListNode - Definition for singly-linked list.
56
type ListNode = kit.ListNode
67

78
/**

‎problems/balanced-binary-tree/balanced_binary_tree.go

+1
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,7 @@ package problem110
22

33
import "github.com/openset/leetcode/internal/kit"
44

5+
// TreeNode - Definition for a binary tree node.
56
type TreeNode = kit.TreeNode
67

78
/**

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

+4-1
Original file line numberDiff line numberDiff line change
@@ -3,9 +3,12 @@ package problem606
33
import (
44
"strconv"
55

6-
. "github.com/openset/leetcode/internal/kit"
6+
"github.com/openset/leetcode/internal/kit"
77
)
88

9+
// TreeNode - Definition for a binary tree node.
10+
type TreeNode = kit.TreeNode
11+
912
/**
1013
* Definition for a binary tree node.
1114
* type TreeNode struct {

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

+3-3
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ package problem606
33
import (
44
"testing"
55

6-
. "github.com/openset/leetcode/internal/kit"
6+
"github.com/openset/leetcode/internal/kit"
77
)
88

99
type caseType struct {
@@ -18,12 +18,12 @@ func TestTree2str(t *testing.T) {
1818
expected: "1(2(4))(3)",
1919
},
2020
{
21-
input: []int{1, 2, 3, NULL, 4},
21+
input: []int{1, 2, 3, kit.NULL, 4},
2222
expected: "1(2()(4))(3)",
2323
},
2424
}
2525
for _, tc := range tests {
26-
output := tree2str(SliceInt2TreeNode(tc.input))
26+
output := tree2str(kit.SliceInt2TreeNode(tc.input))
2727
if output != tc.expected {
2828
t.Fatalf("input: %v, output: %v, expected: %v", tc.input, output, tc.expected)
2929
}

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

+1
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,7 @@ package problem108
22

33
import "github.com/openset/leetcode/internal/kit"
44

5+
// TreeNode - Definition for a binary tree node.
56
type TreeNode = kit.TreeNode
67

78
/**

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

+4-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,9 @@
11
package problem993
22

3-
import . "github.com/openset/leetcode/internal/kit"
3+
import "github.com/openset/leetcode/internal/kit"
4+
5+
// TreeNode - Definition for a binary tree node.
6+
type TreeNode = kit.TreeNode
47

58
/**
69
* Definition for a binary tree node.

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

+6-6
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ package problem993
33
import (
44
"testing"
55

6-
. "github.com/openset/leetcode/internal/kit"
6+
"github.com/openset/leetcode/internal/kit"
77
)
88

99
type caseType struct {
@@ -22,32 +22,32 @@ func TestIsCousins(t *testing.T) {
2222
expected: false,
2323
},
2424
{
25-
input: []int{1, 2, 3, NULL, 4, NULL, 5},
25+
input: []int{1, 2, 3, kit.NULL, 4, kit.NULL, 5},
2626
x: 5,
2727
y: 4,
2828
expected: true,
2929
},
3030
{
31-
input: []int{1, 2, 3, NULL, 4},
31+
input: []int{1, 2, 3, kit.NULL, 4},
3232
x: 2,
3333
y: 3,
3434
expected: false,
3535
},
3636
{
37-
input: []int{1, 2, 3, NULL, 4, 5},
37+
input: []int{1, 2, 3, kit.NULL, 4, 5},
3838
x: 4,
3939
y: 5,
4040
expected: true,
4141
},
4242
{
43-
input: []int{1, 2, 3, NULL, 4, 5},
43+
input: []int{1, 2, 3, kit.NULL, 4, 5},
4444
x: 5,
4545
y: 4,
4646
expected: true,
4747
},
4848
}
4949
for _, tc := range tests {
50-
output := isCousins(SliceInt2TreeNode(tc.input), tc.x, tc.y)
50+
output := isCousins(kit.SliceInt2TreeNode(tc.input), tc.x, tc.y)
5151
if output != tc.expected {
5252
t.Fatalf("input: %v, output: %v, expected: %v", tc.input, output, tc.expected)
5353
}

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

+4-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,9 @@
11
package problem237
22

3-
import . "github.com/openset/leetcode/internal/kit"
3+
import "github.com/openset/leetcode/internal/kit"
4+
5+
// ListNode - Definition for singly-linked list.
6+
type ListNode = kit.ListNode
47

58
/**
69
* Definition for singly-linked list.

‎problems/delete-node-in-a-linked-list/delete_node_in_a_linked_list_test.go

+3-3
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@ import (
44
"reflect"
55
"testing"
66

7-
. "github.com/openset/leetcode/internal/kit"
7+
"github.com/openset/leetcode/internal/kit"
88
)
99

1010
type caseType struct {
@@ -42,13 +42,13 @@ func TestDeleteNode(t *testing.T) {
4242
},
4343
}
4444
for _, tc := range tests {
45-
head := SliceInt2ListNode(tc.input)
45+
head := kit.SliceInt2ListNode(tc.input)
4646
node := head
4747
for node != nil && node.Val != tc.node {
4848
node = node.Next
4949
}
5050
deleteNode(node)
51-
output := ListNode2SliceInt(head)
51+
output := kit.ListNode2SliceInt(head)
5252
if !reflect.DeepEqual(output, tc.expected) {
5353
t.Fatalf("input: %v, output: %v, expected: %v", tc.input, output, tc.expected)
5454
}

‎problems/intersection-of-two-arrays-ii/intersection_of_two_arrays_ii_test.go

+2-2
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ package problem350
33
import (
44
"testing"
55

6-
. "github.com/openset/leetcode/internal/kit"
6+
"github.com/openset/leetcode/internal/kit"
77
)
88

99
type caseType struct {
@@ -32,7 +32,7 @@ func TestIntersect(t *testing.T) {
3232
}
3333
for _, tc := range tests {
3434
output := intersect(tc.nums1, tc.nums2)
35-
if !IsEqualSliceInt(output, tc.expected) {
35+
if !kit.IsEqualSliceInt(output, tc.expected) {
3636
t.Fatalf("input: %v %v, output: %v, expected: %v", tc.nums1, tc.nums2, output, tc.expected)
3737
}
3838
}

‎problems/intersection-of-two-linked-lists/intersection_of_two_linked_lists.go

+4-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,9 @@
11
package problem160
22

3-
import . "github.com/openset/leetcode/internal/kit"
3+
import "github.com/openset/leetcode/internal/kit"
4+
5+
// ListNode - Definition for singly-linked list.
6+
type ListNode = kit.ListNode
47

58
/**
69
* Definition for singly-linked list.

‎problems/intersection-of-two-linked-lists/intersection_of_two_linked_lists_test.go

+4-4
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ package problem160
33
import (
44
"testing"
55

6-
. "github.com/openset/leetcode/internal/kit"
6+
"github.com/openset/leetcode/internal/kit"
77
)
88

99
type caseType struct {
@@ -36,9 +36,9 @@ func TestGetIntersectionNode(t *testing.T) {
3636
},
3737
}
3838
for _, tc := range tests {
39-
intersection := SliceInt2ListNode(tc.intersection)
40-
headA := SliceInt2ListNode(tc.headA)
41-
headB := SliceInt2ListNode(tc.headB)
39+
intersection := kit.SliceInt2ListNode(tc.intersection)
40+
headA := kit.SliceInt2ListNode(tc.headA)
41+
headB := kit.SliceInt2ListNode(tc.headB)
4242
for n := headA; n != nil; n = n.Next {
4343
if n.Next == nil {
4444
n.Next = intersection

‎problems/linked-list-cycle/linked_list_cycle.go

+4-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,9 @@
11
package problem141
22

3-
import . "github.com/openset/leetcode/internal/kit"
3+
import "github.com/openset/leetcode/internal/kit"
4+
5+
// ListNode - Definition for singly-linked list.
6+
type ListNode = kit.ListNode
47

58
/**
69
* Definition for singly-linked list.

‎problems/linked-list-cycle/linked_list_cycle_test.go

+2-2
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ package problem141
33
import (
44
"testing"
55

6-
. "github.com/openset/leetcode/internal/kit"
6+
"github.com/openset/leetcode/internal/kit"
77
)
88

99
type caseType struct {
@@ -36,7 +36,7 @@ func TestHasCycle(t *testing.T) {
3636
},
3737
}
3838
for _, tc := range tests {
39-
input := SliceInt2ListNode(tc.input)
39+
input := kit.SliceInt2ListNode(tc.input)
4040
p, curr := input, input
4141
for i := 0; curr != nil && tc.pos >= 0; i, curr = i+1, curr.Next {
4242
if i == tc.pos {

‎problems/maximum-depth-of-binary-tree/maximum_depth_of_binary_tree.go

+4-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,9 @@
11
package problem104
22

3-
import . "github.com/openset/leetcode/internal/kit"
3+
import "github.com/openset/leetcode/internal/kit"
4+
5+
// TreeNode - Definition for a binary tree node.
6+
type TreeNode = kit.TreeNode
47

58
/**
69
* Definition for a binary tree node.

‎problems/maximum-depth-of-binary-tree/maximum_depth_of_binary_tree_test.go

+6-6
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ package problem104
33
import (
44
"testing"
55

6-
. "github.com/openset/leetcode/internal/kit"
6+
"github.com/openset/leetcode/internal/kit"
77
)
88

99
type caseType struct {
@@ -14,24 +14,24 @@ type caseType struct {
1414
func TestMaxDepth(t *testing.T) {
1515
tests := [...]caseType{
1616
{
17-
input: []int{3, 9, 20, NULL, NULL, 15, 7},
17+
input: []int{3, 9, 20, kit.NULL, kit.NULL, 15, 7},
1818
expected: 3,
1919
},
2020
{
21-
input: []int{1, 2, 3, NULL, 5, 6},
21+
input: []int{1, 2, 3, kit.NULL, 5, 6},
2222
expected: 3,
2323
},
2424
{
25-
input: []int{1, 2, NULL, NULL, 5},
25+
input: []int{1, 2, kit.NULL, kit.NULL, 5},
2626
expected: 3,
2727
},
2828
{
29-
input: []int{1, NULL, 3, NULL, 5},
29+
input: []int{1, kit.NULL, 3, kit.NULL, 5},
3030
expected: 3,
3131
},
3232
}
3333
for _, tc := range tests {
34-
output := maxDepth(SliceInt2TreeNode(tc.input))
34+
output := maxDepth(kit.SliceInt2TreeNode(tc.input))
3535
if output != tc.expected {
3636
t.Fatalf("input: %v, output: %v, expected: %v", tc.input, output, tc.expected)
3737
}

‎problems/median-of-two-sorted-arrays/median_of_two_sorted_arrays.go

+2-3
Original file line numberDiff line numberDiff line change
@@ -24,8 +24,7 @@ func findMedianSortedArrays(nums1 []int, nums2 []int) float64 {
2424
if count&1 == 1 {
2525
k := (count - 1) / 2
2626
return float64(s[k])
27-
} else {
28-
k := count / 2
29-
return (float64(s[k-1]) + float64(s[k])) / 2
3027
}
28+
k := count / 2
29+
return (float64(s[k-1]) + float64(s[k])) / 2
3130
}

‎problems/merge-two-binary-trees/merge_two_binary_trees.go

+4-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,9 @@
11
package problem617
22

3-
import . "github.com/openset/leetcode/internal/kit"
3+
import "github.com/openset/leetcode/internal/kit"
4+
5+
// TreeNode - Definition for a binary tree node.
6+
type TreeNode = kit.TreeNode
47

58
/**
69
* Definition for a binary tree node.

‎problems/merge-two-binary-trees/merge_two_binary_trees_test.go

+5-5
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@ import (
44
"reflect"
55
"testing"
66

7-
. "github.com/openset/leetcode/internal/kit"
7+
"github.com/openset/leetcode/internal/kit"
88
)
99

1010
type caseType struct {
@@ -17,13 +17,13 @@ func TestMergeTrees(t *testing.T) {
1717
tests := [...]caseType{
1818
{
1919
t1: []int{1, 3, 2, 5},
20-
t2: []int{2, 1, 3, NULL, 4, NULL, 7},
21-
expected: []int{3, 4, 5, 5, 4, NULL, 7},
20+
t2: []int{2, 1, 3, kit.NULL, 4, kit.NULL, 7},
21+
expected: []int{3, 4, 5, 5, 4, kit.NULL, 7},
2222
},
2323
}
2424
for _, tc := range tests {
25-
t3 := mergeTrees(SliceInt2TreeNode(tc.t1), SliceInt2TreeNode(tc.t2))
26-
output := TreeNode2SliceInt(t3)
25+
t3 := mergeTrees(kit.SliceInt2TreeNode(tc.t1), kit.SliceInt2TreeNode(tc.t2))
26+
output := kit.TreeNode2SliceInt(t3)
2727
if !reflect.DeepEqual(output, tc.expected) {
2828
t.Fatalf("input: %v %v, output: %v, expected: %v", tc.t1, tc.t2, output, tc.expected)
2929
}

‎problems/merge-two-sorted-lists/merge_two_sorted_lists.go

+4-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,9 @@
11
package problem21
22

3-
import . "github.com/openset/leetcode/internal/kit"
3+
import "github.com/openset/leetcode/internal/kit"
4+
5+
// ListNode - Definition for singly-linked list.
6+
type ListNode = kit.ListNode
47

58
/**
69
* Definition for singly-linked list.

‎problems/merge-two-sorted-lists/merge_two_sorted_lists_test.go

+4-4
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@ import (
44
"reflect"
55
"testing"
66

7-
. "github.com/openset/leetcode/internal/kit"
7+
"github.com/openset/leetcode/internal/kit"
88
)
99

1010
type caseType struct {
@@ -42,9 +42,9 @@ func TestMergeTwoLists(t *testing.T) {
4242
},
4343
}
4444
for _, tc := range tests {
45-
l1 := SliceInt2ListNode(tc.l1)
46-
l2 := SliceInt2ListNode(tc.l2)
47-
output := ListNode2SliceInt(mergeTwoLists(l1, l2))
45+
l1 := kit.SliceInt2ListNode(tc.l1)
46+
l2 := kit.SliceInt2ListNode(tc.l2)
47+
output := kit.ListNode2SliceInt(mergeTwoLists(l1, l2))
4848
if !reflect.DeepEqual(output, tc.expected) {
4949
t.Fatalf("input: %v %v, output: %v, expected: %v", tc.l1, tc.l2, output, tc.expected)
5050
}

‎problems/palindrome-linked-list/palindrome_linked_list.go

+4-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,9 @@
11
package problem234
22

3-
import . "github.com/openset/leetcode/internal/kit"
3+
import "github.com/openset/leetcode/internal/kit"
4+
5+
// ListNode - Definition for singly-linked list.
6+
type ListNode = kit.ListNode
47

58
/**
69
* Definition for singly-linked list.

0 commit comments

Comments
 (0)