Fix go report

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

@@ -74,7 +74,7 @@ Output: [5,-99]
 package leetcode
 
 import (
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 // ListNode define

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

@@ -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_test.go

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

leetcode/0297.Serialize-and-Deserialize-Binary-Tree/297.Serialize and Deserialize Binary Tree.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_test.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/README.md

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

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

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

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

@@ -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/0315.Count-of-Smaller-Numbers-After-Self/315. Count of Smaller Numbers After Self.go

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

leetcode/0327.Count-of-Range-Sum/327. Count of Range Sum.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/0328.Odd-Even-Linked-List/328. Odd Even 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/0328.Odd-Even-Linked-List/328. Odd Even Linked List_test.go

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

leetcode/0337.House-Robber-III/337. House Robber III.go

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

leetcode/0337.House-Robber-III/337. House Robber III_test.go

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

leetcode/0382.Linked-List-Random-Node/382. Linked List Random Node.go

@@ -3,7 +3,7 @@ package leetcode
 import (
 	"math/rand"
 
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 // ListNode define
@@ -20,8 +20,10 @@ type Solution struct {
 	head *ListNode
 }
 
-/** @param head The linked list's head.
-  Note that the head is guaranteed to be not null, so it contains at least one node. */
+/*
+  - @param head The linked list's head.
+    Note that the head is guaranteed to be not null, so it contains at least one node.
+*/
 func Constructor(head *ListNode) Solution {
 	return Solution{head: head}
 }

leetcode/0382.Linked-List-Random-Node/382. Linked List Random Node_test.go

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

leetcode/0382.Linked-List-Random-Node/README.md

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

leetcode/0404.Sum-of-Left-Leaves/404. Sum of Left Leaves.go

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

leetcode/0404.Sum-of-Left-Leaves/404. Sum of Left Leaves_test.go

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

leetcode/0436.Find-Right-Interval/436. Find Right Interval.go

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

leetcode/0437.Path-Sum-III/437. Path Sum III.go

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

leetcode/0437.Path-Sum-III/437. Path Sum III_test.go

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

leetcode/0437.Path-Sum-III/README.md

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

leetcode/0445.Add-Two-Numbers-II/445. Add Two Numbers II.go

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

leetcode/0445.Add-Two-Numbers-II/445. Add Two Numbers II_test.go

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

leetcode/0493.Reverse-Pairs/493. Reverse Pairs.go

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

leetcode/0508.Most-Frequent-Subtree-Sum/508. Most Frequent Subtree Sum.go

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

leetcode/0508.Most-Frequent-Subtree-Sum/508. Most Frequent Subtree Sum_test.go

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

leetcode/0513.Find-Bottom-Left-Tree-Value/513. Find Bottom Left Tree Value.go

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

leetcode/0513.Find-Bottom-Left-Tree-Value/513. Find Bottom Left Tree Value_test.go

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

leetcode/0515.Find-Largest-Value-in-Each-Tree-Row/515. Find Largest Value in Each Tree Row.go

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

leetcode/0515.Find-Largest-Value-in-Each-Tree-Row/515. Find Largest Value in Each Tree Row_test.go

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

leetcode/0530.Minimum-Absolute-Difference-in-BST/530. Minimum Absolute Difference in BST.go

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

leetcode/0530.Minimum-Absolute-Difference-in-BST/530. Minimum Absolute Difference in BST_test.go

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

leetcode/0530.Minimum-Absolute-Difference-in-BST/README.md

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

leetcode/0538.Convert-BST-to-Greater-Tree/538. Convert BST to Greater Tree.go

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

leetcode/0538.Convert-BST-to-Greater-Tree/538. Convert BST to Greater Tree_test.go

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

leetcode/0538.Convert-BST-to-Greater-Tree/README.md

@@ -70,7 +70,7 @@ Output: [7,9,4,10]
 package leetcode
 
 import (
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 // TreeNode define

leetcode/0543.Diameter-of-Binary-Tree/543. Diameter of 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/0543.Diameter-of-Binary-Tree/543. Diameter of Binary Tree_test.go

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

leetcode/0543.Diameter-of-Binary-Tree/README.md

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

leetcode/0547.Number-of-Provinces/547. Number of Provinces.go

@@ -1,7 +1,7 @@
 package leetcode
 
 import (
-	"github.com/halfrost/LeetCode-Go/template"
+	"github.com/halfrost/leetcode-go/template"
 )
 
 // 解法一 并查集

leetcode/0563.Binary-Tree-Tilt/563. Binary Tree Tilt.go

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

leetcode/0563.Binary-Tree-Tilt/563. Binary Tree Tilt_test.go

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

leetcode/0572.Subtree-of-Another-Tree/572. Subtree of Another Tree.go

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

leetcode/0572.Subtree-of-Another-Tree/572. Subtree of Another Tree_test.go

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

leetcode/0589.N-ary-Tree-Preorder-Traversal/589. N-ary Tree Preorder Traversal_test.go

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

leetcode/0617.Merge-Two-Binary-Trees/617. Merge Two Binary Trees.go

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

leetcode/0617.Merge-Two-Binary-Trees/617. Merge Two Binary Trees_test.go

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

leetcode/0617.Merge-Two-Binary-Trees/README.md

@@ -50,7 +50,7 @@ Output: [2,2]
 package leetcode
 
 import (
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 // TreeNode define

leetcode/0623.Add-One-Row-to-Tree/623. Add One Row to Tree.go

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

leetcode/0623.Add-One-Row-to-Tree/623. Add One Row to Tree_test.go

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

leetcode/0623.Add-One-Row-to-Tree/README.md

@@ -68,7 +68,7 @@ v = 1d = 3Output:
 package leetcode
 
 import (
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 // TreeNode define

leetcode/0637.Average-of-Levels-in-Binary-Tree/637. Average of Levels in 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/0637.Average-of-Levels-in-Binary-Tree/637. Average of Levels in Binary Tree_test.go

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

leetcode/0653.Two-Sum-IV-Input-is-a-BST/653. Two Sum IV - Input is 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/0653.Two-Sum-IV-Input-is-a-BST/653. Two Sum IV - Input is a BST_test.go

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

leetcode/0662.Maximum-Width-of-Binary-Tree/662. Maximum Width of 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/0662.Maximum-Width-of-Binary-Tree/662. Maximum Width of Binary Tree_test.go

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

leetcode/0669.Trim-a-Binary-Search-Tree/669. Trim 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/0669.Trim-a-Binary-Search-Tree/669. Trim 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 question669 struct {

leetcode/0669.Trim-a-Binary-Search-Tree/README.md

@@ -68,7 +68,7 @@ Output: [2]
 package leetcode
 
 import (
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 // TreeNode define

leetcode/0684.Redundant-Connection/684. Redundant Connection.go

@@ -1,7 +1,7 @@
 package leetcode
 
 import (
-	"github.com/halfrost/LeetCode-Go/template"
+	"github.com/halfrost/leetcode-go/template"
 )
 
 func findRedundantConnection(edges [][]int) []int {

leetcode/0699.Falling-Squares/699. Falling Squares.go

@@ -3,7 +3,7 @@ package leetcode
 import (
 	"sort"
 
-	"github.com/halfrost/LeetCode-Go/template"
+	"github.com/halfrost/leetcode-go/template"
 )
 
 func fallingSquares(positions [][]int) []int {

leetcode/0700.Search-in-a-Binary-Search-Tree/700.Search in 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/0700.Search-in-a-Binary-Search-Tree/README.md

@@ -42,7 +42,7 @@ Find the node in the BST that the node's value equals val and return the subtree
 package leetcode
 
 import (
-	"github.com/halfrost/LeetCode-Go/structures"
+	"github.com/halfrost/leetcode-go/structures"
 )
 
 // TreeNode define

leetcode/0701.Insert-into-a-Binary-Search-Tree/701. Insert into a Binary Search Tree.go

@@ -1,6 +1,6 @@
 package leetcode
 
-import "github.com/halfrost/LeetCode-Go/structures"
+import "github.com/halfrost/leetcode-go/structures"
 
 // TreeNode define
 type TreeNode = structures.TreeNode

leetcode/0701.Insert-into-a-Binary-Search-Tree/701. Insert into 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 question701 struct {

leetcode/0701.Insert-into-a-Binary-Search-Tree/README.md

@@ -57,7 +57,7 @@ Output: [4,2,7,1,3,5]
 ```go
 package leetcode
 
-import "github.com/halfrost/LeetCode-Go/structures"
+import "github.com/halfrost/leetcode-go/structures"
 
 // TreeNode define
 type TreeNode = structures.TreeNode