Fix go report

Author: halfrost

leetcode/0145.Binary-Tree-Postorder-Traversal/145. Binary Tree Postorder Traversal.go

@@ -1,7 +1,7 @@
 package leetcode
 
 import (
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 // TreeNode define

leetcode/0145.Binary-Tree-Postorder-Traversal/145. Binary Tree Postorder Traversal_test.go

@@ -4,7 +4,7 @@ import (
 	"fmt"
 	"testing"
 
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 type question145 struct {

leetcode/0147.Insertion-Sort-List/147. Insertion Sort List.go

@@ -1,7 +1,7 @@
 package leetcode
 
 import (
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 // ListNode define

leetcode/0147.Insertion-Sort-List/147. Insertion Sort List_test.go

@@ -4,7 +4,7 @@ import (
 	"fmt"
 	"testing"
 
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 type question147 struct {

leetcode/0148.Sort-List/148. Sort List.go

@@ -1,7 +1,7 @@
 package leetcode
 
 import (
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 // ListNode define

leetcode/0148.Sort-List/148. Sort List_test.go

@@ -4,7 +4,7 @@ import (
 	"fmt"
 	"testing"
 
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 type question148 struct {

leetcode/0160.Intersection-of-Two-Linked-Lists/160. Intersection of Two Linked Lists.go

@@ -1,9 +1,9 @@
 package leetcode
 
-import "fmt"
-
 import (
-	"github.com/halfrost/LeetCode-Go/structures"
+	"fmt"
+
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 // ListNode define

leetcode/0160.Intersection-of-Two-Linked-Lists/160. Intersection of Two Linked Lists_test.go

@@ -4,7 +4,7 @@ import (
 	"fmt"
 	"testing"
 
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 type question160 struct {

leetcode/0173.Binary-Search-Tree-Iterator/173. Binary Search Tree Iterator.go

@@ -3,7 +3,7 @@ package leetcode
 import (
 	"container/heap"
 
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 // TreeNode define

leetcode/0173.Binary-Search-Tree-Iterator/173. Binary Search Tree Iterator_test.go

@@ -4,7 +4,7 @@ import (
 	"fmt"
 	"testing"
 
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 func Test_Problem173(t *testing.T) {

leetcode/0199.Binary-Tree-Right-Side-View/199. Binary Tree Right Side View.go

@@ -1,7 +1,7 @@
 package leetcode
 
 import (
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 // TreeNode define

leetcode/0199.Binary-Tree-Right-Side-View/199. Binary Tree Right Side View_test.go

@@ -4,7 +4,7 @@ import (
 	"fmt"
 	"testing"
 
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 type question199 struct {

leetcode/0203.Remove-Linked-List-Elements/203. Remove Linked List Elements.go

@@ -1,7 +1,7 @@
 package leetcode
 
 import (
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 // ListNode define

leetcode/0203.Remove-Linked-List-Elements/203. Remove Linked List Elements_test.go

@@ -4,7 +4,7 @@ import (
 	"fmt"
 	"testing"
 
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 type question203 struct {

leetcode/0206.Reverse-Linked-List/206. Reverse Linked List.go

@@ -1,7 +1,7 @@
 package leetcode
 
 import (
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 // ListNode define

leetcode/0206.Reverse-Linked-List/206. Reverse Linked List_test.go

@@ -4,7 +4,7 @@ import (
 	"fmt"
 	"testing"
 
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 type question206 struct {

leetcode/0218.The-Skyline-Problem/218. The Skyline Problem.go

@@ -3,7 +3,7 @@ package leetcode
 import (
 	"sort"
 
-	"github.com/halfrost/LeetCode-Go/template"
+	"github.com/halfrost/leetcode-go/template"
 )
 
 // 解法一 树状数组，时间复杂度 O(n log n)

leetcode/0222.Count-Complete-Tree-Nodes/222. Count Complete Tree Nodes.go

@@ -1,7 +1,7 @@
 package leetcode
 
 import (
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 // TreeNode define

leetcode/0222.Count-Complete-Tree-Nodes/222. Count Complete Tree Nodes_test.go

@@ -4,7 +4,7 @@ import (
 	"fmt"
 	"testing"
 
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 type question222 struct {

leetcode/0226.Invert-Binary-Tree/226. Invert Binary Tree.go

@@ -1,7 +1,7 @@
 package leetcode
 
 import (
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 // TreeNode define

leetcode/0226.Invert-Binary-Tree/226. Invert Binary Tree_test.go

@@ -4,7 +4,7 @@ import (
 	"fmt"
 	"testing"
 
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 type question226 struct {

leetcode/0230.Kth-Smallest-Element-in-a-BST/230. Kth Smallest Element in a BST.go

@@ -1,7 +1,7 @@
 package leetcode
 
 import (
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 // TreeNode define

leetcode/0230.Kth-Smallest-Element-in-a-BST/230. Kth Smallest Element in a BST_test.go

@@ -4,7 +4,7 @@ import (
 	"fmt"
 	"testing"
 
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 type question230 struct {

leetcode/0234.Palindrome-Linked-List/234. Palindrome Linked List.go

@@ -1,7 +1,7 @@
 package leetcode
 
 import (
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 // ListNode define

leetcode/0234.Palindrome-Linked-List/234. Palindrome Linked List_test.go

@@ -4,7 +4,7 @@ import (
 	"fmt"
 	"testing"
 
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 type question234 struct {

leetcode/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree/235. Lowest Common Ancestor of a Binary Search Tree.go

@@ -1,7 +1,7 @@
 package leetcode
 
 import (
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 // TreeNode define

leetcode/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree/235. Lowest Common Ancestor of a Binary Search Tree_test.go

@@ -4,7 +4,7 @@ import (
 	"fmt"
 	"testing"
 
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 type question235 struct {

leetcode/0236.Lowest-Common-Ancestor-of-a-Binary-Tree/236. Lowest Common Ancestor of a Binary Tree.go

@@ -1,7 +1,7 @@
 package leetcode
 
 import (
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 // TreeNode define

leetcode/0236.Lowest-Common-Ancestor-of-a-Binary-Tree/236. Lowest Common Ancestor of a Binary Tree_test.go

@@ -4,7 +4,7 @@ import (
 	"fmt"
 	"testing"
 
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 type question236 struct {

leetcode/0237.Delete-Node-in-a-Linked-List/237. Delete Node in a Linked List.go

@@ -1,7 +1,7 @@
 package leetcode
 
 import (
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 // ListNode define

leetcode/0237.Delete-Node-in-a-Linked-List/237. Delete Node in a Linked List_test.go

@@ -4,7 +4,7 @@ import (
 	"fmt"
 	"testing"
 
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 type question237 struct {

leetcode/0237.Delete-Node-in-a-Linked-List/README.md

@@ -2,10 +2,8 @@ package leetcode
 
 import (
 	"strconv"
-)
 
-import (
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 // TreeNode define

leetcode/0257.Binary-Tree-Paths/257. Binary Tree Paths.go

@@ -4,7 +4,7 @@ import (
 	"fmt"
 	"testing"
 
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 type question257 struct {

leetcode/0257.Binary-Tree-Paths/257. Binary Tree Paths_test.go

@@ -4,7 +4,7 @@ import (
 	"strconv"
 	"strings"
 
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 type TreeNode = structures.TreeNode

leetcode/0297.Serialize-and-Deserialize-Binary-Tree/297.Serialize and Deserialize Binary Tree.go

@@ -4,7 +4,7 @@ import (
 	"fmt"
 	"testing"
 
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 type question297 struct {
@@ -31,12 +31,12 @@ func Test_Problem297(t *testing.T) {
 			ans297{[]int{}},
 		},
 		{
-			para297{[]int{1,2,3,-1,-1,4,5}},
-			ans297{[]int{1,2,3,-1,-1,4,5}},
+			para297{[]int{1, 2, 3, -1, -1, 4, 5}},
+			ans297{[]int{1, 2, 3, -1, -1, 4, 5}},
 		},
 		{
-			para297{[]int{1,2}},
-			ans297{[]int{1,2}},
+			para297{[]int{1, 2}},
+			ans297{[]int{1, 2}},
 		},
 	}
 
@@ -52,4 +52,4 @@ func Test_Problem297(t *testing.T) {
 		fmt.Printf("【output】:%v      \n", structures.Tree2Preorder(tree297.deserialize(serialized)))
 	}
 	fmt.Printf("\n\n\n")
-}
+}

leetcode/0297.Serialize-and-Deserialize-Binary-Tree/297.Serialize and Deserialize Binary Tree_test.go

@@ -1,7 +1,7 @@
 package leetcode
 
 import (
-	"github.com/halfrost/LeetCode-Go/template"
+	"github.com/halfrost/leetcode-go/template"
 )
 
 //解法一 线段树，sumRange 时间复杂度 O(1)

leetcode/0297.Serialize-and-Deserialize-Binary-Tree/README.md

@@ -1,6 +1,6 @@
 package leetcode
 
-import "github.com/halfrost/LeetCode-Go/template"
+import "github.com/halfrost/leetcode-go/template"
 
 // NumArray define
 type NumArray struct {

leetcode/0303.Range-Sum-Query-Immutable/303. Range Sum Query - Immutable.go

@@ -3,7 +3,7 @@ package leetcode
 import (
 	"sort"
 
-	"github.com/halfrost/LeetCode-Go/template"
+	"github.com/halfrost/leetcode-go/template"
 )
 
 // 解法一 线段树

leetcode/0307.Range-Sum-Query-Mutable/307. Range Sum Query - Mutable.go

@@ -3,7 +3,7 @@ package leetcode
 import (
 	"sort"
 
-	"github.com/halfrost/LeetCode-Go/template"
+	"github.com/halfrost/leetcode-go/template"
 )
 
 // 解法一 线段树，时间复杂度 O(n log n)