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) {