maximum_binary_tree_ii

masx200 · masx200 · commit 3f6736c4e6b1 · 2023-05-06T22:40:42.000+08:00
diff --git a/counting-words-with-a-given-prefix/export.go b/counting-words-with-a-given-prefix/export.go
@@ -1,4 +1,4 @@
-package index
+package counting_words_with_a_given_prefix
 
 func PrefixCount(words []string, pref string) int {
 	return prefixCount(words, pref)
diff --git a/counting-words-with-a-given-prefix/index.go b/counting-words-with-a-given-prefix/index.go
@@ -1,4 +1,4 @@
-package index
+package counting_words_with_a_given_prefix
 
 import "strings"
 
diff --git a/deepest-leaves-sum/deepestLeavesSum_test.go b/deepest-leaves-sum/deepestLeavesSum_test.go
@@ -1,4 +1,4 @@
-package index
+package deepest_leaves_sum
 
 import (
 	"testing"
diff --git a/deepest-leaves-sum/export.go b/deepest-leaves-sum/export.go
@@ -1,4 +1,4 @@
-package index
+package deepest_leaves_sum
 
 func DeepestLeavesSum(root *TreeNode) int {
 	return deepestLeavesSum(root)
diff --git a/deepest-leaves-sum/index.go b/deepest-leaves-sum/index.go
@@ -1,4 +1,4 @@
-package index
+package deepest_leaves_sum
 
 import serialize_and_deserialize_binary_tree "github.com/masx200/leetcode-test/serialize-and-deserialize-binary-tree"
 
diff --git a/design-skiplist/Skiplist_test.go b/design-skiplist/Skiplist_test.go
@@ -1,4 +1,4 @@
-package index
+package design_skiplist
 
 import "testing"
 import "gotest.tools/v3/assert"
diff --git a/design-skiplist/index.go b/design-skiplist/index.go
@@ -1,4 +1,4 @@
-package index
+package design_skiplist
 
 type Skiplist struct {
 	store map[int]int
diff --git a/maximum-binary-tree-ii/export.go b/maximum-binary-tree-ii/export.go
@@ -1,4 +1,4 @@
-package index
+package maximum_binary_tree_ii
 
 func InsertIntoMaxTree(root *TreeNode, val int) *TreeNode {
 	return insertIntoMaxTree(root, val)
diff --git a/maximum-binary-tree-ii/index.go b/maximum-binary-tree-ii/index.go
@@ -1,4 +1,4 @@
-package index
+package maximum_binary_tree_ii
 
 import serialize_and_deserialize_binary_tree "github.com/masx200/leetcode-test/serialize-and-deserialize-binary-tree"
 
diff --git a/maximum-binary-tree/constructMaximumBinaryTree_test.go b/maximum-binary-tree/constructMaximumBinaryTree_test.go
@@ -1,4 +1,4 @@
-package index
+package maximum_binary_tree
 
 import (
 	"strings"
diff --git a/maximum-binary-tree/export.go b/maximum-binary-tree/export.go
@@ -1,4 +1,4 @@
-package index
+package maximum_binary_tree
 
 func ConstructMaximumBinaryTree(nums []int) *TreeNode {
 	return constructMaximumBinaryTree(nums)
diff --git a/maximum-binary-tree/index.go b/maximum-binary-tree/index.go
@@ -1,4 +1,4 @@
-package index
+package maximum_binary_tree
 
 import maximum_binary_tree_ii "github.com/masx200/leetcode-test/maximum-binary-tree-ii"
 import serialize_and_deserialize_binary_tree "github.com/masx200/leetcode-test/serialize-and-deserialize-binary-tree"

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package index`
	`1`	`+package counting_words_with_a_given_prefix`
`2`	`2`
`3`	`3`	`func PrefixCount(words []string, pref string) int {`
`4`	`4`	`return prefixCount(words, pref)`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package index`
	`1`	`+package deepest_leaves_sum`
`2`	`2`
`3`	`3`	`import (`
`4`	`4`	`"testing"`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package index`
	`1`	`+package design_skiplist`
`2`	`2`
`3`	`3`	`import "testing"`
`4`	`4`	`import "gotest.tools/v3/assert"`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package index`
	`1`	`+package maximum_binary_tree_ii`
`2`	`2`
`3`	`3`	`func InsertIntoMaxTree(root TreeNode, val int) TreeNode {`
`4`	`4`	`return insertIntoMaxTree(root, val)`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package index`
	`1`	`+package maximum_binary_tree`
`2`	`2`
`3`	`3`	`import (`
`4`	`4`	`"strings"`