fix: imports to correct package

austingebauer · austingebauer · commit 386e33e7a8d8 · 2020-03-28T00:34:30.000-07:00
diff --git a/add_two_numbers_2/solution.go b/add_two_numbers_2/solution.go
@@ -1,7 +1,7 @@
 package add_two_numbers_2
 
 import (
-	"github.com/austingebauer/leetcode/structures"
+	"github.com/austingebauer/go-leetcode/structures"
 	"math/big"
 )
 
diff --git a/add_two_numbers_2/solution_test.go b/add_two_numbers_2/solution_test.go
@@ -1,7 +1,7 @@
 package add_two_numbers_2
 
 import (
-	"github.com/austingebauer/leetcode/structures"
+	"github.com/austingebauer/go-leetcode/structures"
 	"github.com/stretchr/testify/assert"
 	"testing"
 )
diff --git a/binary_tree_level_order_traversal_102/solution.go b/binary_tree_level_order_traversal_102/solution.go
@@ -1,6 +1,6 @@
 package binary_tree_level_order_traversal_102
 
-import . "github.com/austingebauer/leetcode/structures"
+import . "github.com/austingebauer/go-leetcode/structures"
 
 // Slight variation of first correct solution below, which
 // doesn't keep counters for the number of elements in a
diff --git a/binary_tree_level_order_traversal_102/solution_test.go b/binary_tree_level_order_traversal_102/solution_test.go
@@ -1,7 +1,7 @@
 package binary_tree_level_order_traversal_102
 
 import (
-	. "github.com/austingebauer/leetcode/structures"
+	. "github.com/austingebauer/go-leetcode/structures"
 	"github.com/stretchr/testify/assert"
 	"testing"
 )
diff --git a/binary_tree_maximum_path_sum_124/solution.go b/binary_tree_maximum_path_sum_124/solution.go
@@ -1,7 +1,7 @@
 package binary_tree_maximum_path_sum_124
 
 import (
-	. "github.com/austingebauer/leetcode/structures"
+	. "github.com/austingebauer/go-leetcode/structures"
 	"math"
 )
 
diff --git a/binary_tree_maximum_path_sum_124/solution_test.go b/binary_tree_maximum_path_sum_124/solution_test.go
@@ -4,7 +4,7 @@ import (
 	"github.com/stretchr/testify/assert"
 	"testing"
 )
-import . "github.com/austingebauer/leetcode/structures"
+import . "github.com/austingebauer/go-leetcode/structures"
 
 func Test_maxPathSum(t *testing.T) {
 	type args struct {
diff --git a/construct_binary_tree_from_preorder_and_inorder_traversal_105/solution.go b/construct_binary_tree_from_preorder_and_inorder_traversal_105/solution.go
@@ -1,6 +1,6 @@
 package construct_binary_tree_from_preorder_and_inorder_traversal_105
 
-import . "github.com/austingebauer/leetcode/structures"
+import . "github.com/austingebauer/go-leetcode/structures"
 
 func buildTree(preorder []int, inorder []int) *TreeNode {
 	if len(preorder) == 0 {
diff --git a/construct_binary_tree_from_preorder_and_inorder_traversal_105/solution_test.go b/construct_binary_tree_from_preorder_and_inorder_traversal_105/solution_test.go
@@ -1,7 +1,7 @@
 package construct_binary_tree_from_preorder_and_inorder_traversal_105
 
 import (
-	. "github.com/austingebauer/leetcode/structures"
+	. "github.com/austingebauer/go-leetcode/structures"
 	"github.com/stretchr/testify/assert"
 	"testing"
 )
diff --git a/delete_node_in_a_linked_list_237/solution.go b/delete_node_in_a_linked_list_237/solution.go
@@ -1,6 +1,6 @@
 package delete_node_in_a_linked_list_237
 
-import . "github.com/austingebauer/leetcode/structures"
+import . "github.com/austingebauer/go-leetcode/structures"
 
 /**
  * Definition for singly-linked list.
diff --git a/delete_node_in_a_linked_list_237/solution_test.go b/delete_node_in_a_linked_list_237/solution_test.go
@@ -1,7 +1,7 @@
 package delete_node_in_a_linked_list_237
 
 import (
-	. "github.com/austingebauer/leetcode/structures"
+	. "github.com/austingebauer/go-leetcode/structures"
 	"github.com/stretchr/testify/assert"
 	"testing"
 )
diff --git a/inorder_successor_in_bst_285/solution.go b/inorder_successor_in_bst_285/solution.go
@@ -1,7 +1,7 @@
 package inorder_successor_in_bst_285
 
 import (
-	. "github.com/austingebauer/leetcode/structures"
+	. "github.com/austingebauer/go-leetcode/structures"
 )
 
 /**
diff --git a/inorder_successor_in_bst_285/solution_test.go b/inorder_successor_in_bst_285/solution_test.go
@@ -1,7 +1,7 @@
 package inorder_successor_in_bst_285
 
 import (
-	. "github.com/austingebauer/leetcode/structures"
+	. "github.com/austingebauer/go-leetcode/structures"
 	"github.com/stretchr/testify/assert"
 	"testing"
 )
diff --git a/invert_binary_tree_226/solution.go b/invert_binary_tree_226/solution.go
@@ -1,6 +1,6 @@
 package invert_binary_tree_226
 
-import . "github.com/austingebauer/leetcode/structures"
+import . "github.com/austingebauer/go-leetcode/structures"
 
 func invertTree(root *TreeNode) *TreeNode {
 	if root == nil {
diff --git a/invert_binary_tree_226/solution_test.go b/invert_binary_tree_226/solution_test.go
@@ -1,7 +1,7 @@
 package invert_binary_tree_226
 
 import (
-	. "github.com/austingebauer/leetcode/structures"
+	. "github.com/austingebauer/go-leetcode/structures"
 	"github.com/stretchr/testify/assert"
 	"testing"
 )
diff --git a/linked_list_cycle_141/solution.go b/linked_list_cycle_141/solution.go
@@ -1,6 +1,6 @@
 package linked_list_cycle_141
 
-import . "github.com/austingebauer/leetcode/structures"
+import . "github.com/austingebauer/go-leetcode/structures"
 
 // Time: O(n)
 // Space: O(1)
diff --git a/linked_list_cycle_141/solution_test.go b/linked_list_cycle_141/solution_test.go
@@ -1,7 +1,7 @@
 package linked_list_cycle_141
 
 import (
-	. "github.com/austingebauer/leetcode/structures"
+	. "github.com/austingebauer/go-leetcode/structures"
 	"github.com/stretchr/testify/assert"
 	"testing"
 )
diff --git a/maximum_depth_of_binary_tree_104/solution.go b/maximum_depth_of_binary_tree_104/solution.go
@@ -1,7 +1,7 @@
 package maximum_depth_of_binary_tree_104
 
 import (
-	. "github.com/austingebauer/leetcode/structures"
+	. "github.com/austingebauer/go-leetcode/structures"
 	"math"
 )
 
diff --git a/maximum_depth_of_binary_tree_104/solution_test.go b/maximum_depth_of_binary_tree_104/solution_test.go
@@ -1,7 +1,7 @@
 package maximum_depth_of_binary_tree_104
 
 import (
-	. "github.com/austingebauer/leetcode/structures"
+	. "github.com/austingebauer/go-leetcode/structures"
 	"github.com/stretchr/testify/assert"
 	"testing"
 )
diff --git a/merge_k_sorted_lists_23/solution.go b/merge_k_sorted_lists_23/solution.go
@@ -1,6 +1,6 @@
 package merge_k_sorted_lists_23
 
-import . "github.com/austingebauer/leetcode/structures"
+import . "github.com/austingebauer/go-leetcode/structures"
 
 /**
  * Definition for singly-linked list.
diff --git a/merge_k_sorted_lists_23/solution_test.go b/merge_k_sorted_lists_23/solution_test.go
@@ -1,7 +1,7 @@
 package merge_k_sorted_lists_23
 
 import (
-	. "github.com/austingebauer/leetcode/structures"
+	. "github.com/austingebauer/go-leetcode/structures"
 	"github.com/stretchr/testify/assert"
 	"testing"
 )
diff --git a/merge_two_sorted_lists_21/solution.go b/merge_two_sorted_lists_21/solution.go
@@ -1,6 +1,6 @@
 package merge_two_sorted_lists_21
 
-import . "github.com/austingebauer/leetcode/structures"
+import . "github.com/austingebauer/go-leetcode/structures"
 
 func mergeTwoLists2(l1 *ListNode, l2 *ListNode) *ListNode {
 	// Note: Cool technique to not have to worry about front of list being null
diff --git a/merge_two_sorted_lists_21/solution_test.go b/merge_two_sorted_lists_21/solution_test.go
@@ -1,7 +1,7 @@
 package merge_two_sorted_lists_21
 
 import (
-	s "github.com/austingebauer/leetcode/structures"
+	s "github.com/austingebauer/go-leetcode/structures"
 	"github.com/stretchr/testify/assert"
 	"testing"
 )
diff --git a/palindrome_linked_list_234/solution.go b/palindrome_linked_list_234/solution.go
@@ -1,7 +1,7 @@
 package palindrome_linked_list_234
 
 import (
-	. "github.com/austingebauer/leetcode/structures"
+	. "github.com/austingebauer/go-leetcode/structures"
 )
 
 /**
diff --git a/palindrome_linked_list_234/solution_test.go b/palindrome_linked_list_234/solution_test.go
@@ -1,7 +1,7 @@
 package palindrome_linked_list_234
 
 import (
-	. "github.com/austingebauer/leetcode/structures"
+	. "github.com/austingebauer/go-leetcode/structures"
 	"github.com/stretchr/testify/assert"
 	"testing"
 )
diff --git a/remove_nth_node_from_end_of_list_19/solution.go b/remove_nth_node_from_end_of_list_19/solution.go
@@ -1,6 +1,6 @@
 package remove_nth_node_from_end_of_list_19
 
-import . "github.com/austingebauer/leetcode/structures"
+import . "github.com/austingebauer/go-leetcode/structures"
 
 func removeNthFromEnd(head *ListNode, n int) *ListNode {
 	n = df(head, n)
diff --git a/remove_nth_node_from_end_of_list_19/solution_test.go b/remove_nth_node_from_end_of_list_19/solution_test.go
@@ -1,7 +1,7 @@
 package remove_nth_node_from_end_of_list_19
 
 import (
-	. "github.com/austingebauer/leetcode/structures"
+	. "github.com/austingebauer/go-leetcode/structures"
 	"github.com/stretchr/testify/assert"
 	"testing"
 )
diff --git a/reorder_list_143/solution.go b/reorder_list_143/solution.go
@@ -1,6 +1,6 @@
 package reorder_list_143
 
-import . "github.com/austingebauer/leetcode/structures"
+import . "github.com/austingebauer/go-leetcode/structures"
 
 func reorderList(head *ListNode) {
 	if head == nil || head.Next == nil {
diff --git a/reorder_list_143/solution_test.go b/reorder_list_143/solution_test.go
@@ -1,7 +1,7 @@
 package reorder_list_143
 
 import (
-	. "github.com/austingebauer/leetcode/structures"
+	. "github.com/austingebauer/go-leetcode/structures"
 	"github.com/stretchr/testify/assert"
 	"testing"
 )
diff --git a/reverse_linked_list_206/solution.go b/reverse_linked_list_206/solution.go
@@ -1,6 +1,6 @@
 package reverse_linked_list_206
 
-import . "github.com/austingebauer/leetcode/structures"
+import . "github.com/austingebauer/go-leetcode/structures"
 
 // Returns a pointer to a list that is the reverse of the passed head.
 // This function prepends the first n values in the passed list
diff --git a/reverse_linked_list_206/solution_test.go b/reverse_linked_list_206/solution_test.go
@@ -1,7 +1,7 @@
 package reverse_linked_list_206
 
 import (
-	s "github.com/austingebauer/leetcode/structures"
+	s "github.com/austingebauer/go-leetcode/structures"
 	"github.com/stretchr/testify/assert"
 	"testing"
 )
diff --git a/same_tree_100/solution.go b/same_tree_100/solution.go
@@ -1,6 +1,6 @@
 package same_tree_100
 
-import . "github.com/austingebauer/leetcode/structures"
+import . "github.com/austingebauer/go-leetcode/structures"
 
 func isSameTree(p *TreeNode, q *TreeNode) bool {
 	// if p is nil and q is not or vice versa
diff --git a/same_tree_100/solution_test.go b/same_tree_100/solution_test.go
@@ -1,7 +1,7 @@
 package same_tree_100
 
 import (
-	. "github.com/austingebauer/leetcode/structures"
+	. "github.com/austingebauer/go-leetcode/structures"
 	"github.com/stretchr/testify/assert"
 	"testing"
 )
diff --git a/subtree_of_another_tree_572/solution.go b/subtree_of_another_tree_572/solution.go
@@ -1,7 +1,7 @@
 package subtree_of_another_tree_572
 
 import (
-	. "github.com/austingebauer/leetcode/structures"
+	. "github.com/austingebauer/go-leetcode/structures"
 )
 
 /**
diff --git a/subtree_of_another_tree_572/solution_test.go b/subtree_of_another_tree_572/solution_test.go
@@ -1,7 +1,7 @@
 package subtree_of_another_tree_572
 
 import (
-	. "github.com/austingebauer/leetcode/structures"
+	. "github.com/austingebauer/go-leetcode/structures"
 	"github.com/stretchr/testify/assert"
 	"testing"
 )
diff --git a/symmetric_tree_101/solution.go b/symmetric_tree_101/solution.go
@@ -1,6 +1,6 @@
 package symmetric_tree_101
 
-import . "github.com/austingebauer/leetcode/structures"
+import . "github.com/austingebauer/go-leetcode/structures"
 
 /**
  * Definition for a binary tree node.
diff --git a/symmetric_tree_101/solution_test.go b/symmetric_tree_101/solution_test.go
@@ -1,7 +1,7 @@
 package symmetric_tree_101
 
 import (
-	. "github.com/austingebauer/leetcode/structures"
+	. "github.com/austingebauer/go-leetcode/structures"
 	"github.com/stretchr/testify/assert"
 	"testing"
 )
diff --git a/validate_binary_search_tree_98/solution.go b/validate_binary_search_tree_98/solution.go
@@ -1,6 +1,6 @@
 package validate_binary_search_tree_98
 
-import . "github.com/austingebauer/leetcode/structures"
+import . "github.com/austingebauer/go-leetcode/structures"
 
 func isValidBST(root *TreeNode) bool {
 	if root == nil || (root.Left == nil && root.Right == nil) {
diff --git a/validate_binary_search_tree_98/solution_test.go b/validate_binary_search_tree_98/solution_test.go
@@ -1,7 +1,7 @@
 package validate_binary_search_tree_98
 
 import (
-	. "github.com/austingebauer/leetcode/structures"
+	. "github.com/austingebauer/go-leetcode/structures"
 	"github.com/stretchr/testify/assert"
 	"testing"
 )

Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,7 @@`
`1`	`1`	`package add_two_numbers_2`
`2`	`2`
`3`	`3`	`import (`
`4`		`- "github.com/austingebauer/leetcode/structures"`
	`4`	`+ "github.com/austingebauer/go-leetcode/structures"`
`5`	`5`	`"math/big"`
`6`	`6`	`)`
`7`	`7`
Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,7 @@`
`1`	`1`	`package binary_tree_level_order_traversal_102`
`2`	`2`
`3`	`3`	`import (`
`4`		`- . "github.com/austingebauer/leetcode/structures"`
	`4`	`+ . "github.com/austingebauer/go-leetcode/structures"`
`5`	`5`	`"github.com/stretchr/testify/assert"`
`6`	`6`	`"testing"`
`7`	`7`	`)`
Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,7 @@`
`1`	`1`	`package binary_tree_maximum_path_sum_124`
`2`	`2`
`3`	`3`	`import (`
`4`		`- . "github.com/austingebauer/leetcode/structures"`
	`4`	`+ . "github.com/austingebauer/go-leetcode/structures"`
`5`	`5`	`"math"`
`6`	`6`	`)`
`7`	`7`
Original file line number	Diff line number	Diff line change
`@@ -4,7 +4,7 @@ import (`
`4`	`4`	`"github.com/stretchr/testify/assert"`
`5`	`5`	`"testing"`
`6`	`6`	`)`
`7`		`-import . "github.com/austingebauer/leetcode/structures"`
	`7`	`+import . "github.com/austingebauer/go-leetcode/structures"`
`8`	`8`
`9`	`9`	`func Test_maxPathSum(t *testing.T) {`
`10`	`10`	`type args struct {`
Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,7 @@`
`1`	`1`	`package construct_binary_tree_from_preorder_and_inorder_traversal_105`
`2`	`2`
`3`	`3`	`import (`
`4`		`- . "github.com/austingebauer/leetcode/structures"`
	`4`	`+ . "github.com/austingebauer/go-leetcode/structures"`
`5`	`5`	`"github.com/stretchr/testify/assert"`
`6`	`6`	`"testing"`
`7`	`7`	`)`
Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,7 @@`
`1`	`1`	`package delete_node_in_a_linked_list_237`
`2`	`2`
`3`	`3`	`import (`
`4`		`- . "github.com/austingebauer/leetcode/structures"`
	`4`	`+ . "github.com/austingebauer/go-leetcode/structures"`
`5`	`5`	`"github.com/stretchr/testify/assert"`
`6`	`6`	`"testing"`
`7`	`7`	`)`