格式化

masx200 · masx200 · commit 7cc13d33d200 · 2023-05-06T22:46:46.000+08:00
diff --git a/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/export.go b/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/export.go
@@ -1,4 +1,5 @@
 package check_if_a_word_occurs_as_a_prefix_of_any_word_in_a_sentence
+
 func IsPrefixOfWord(sentence string, searchWord string) int {
-	return isPrefixOfWord(sentence,searchWord)
-}
+	return isPrefixOfWord(sentence, searchWord)
+}
diff --git a/count-complete-tree-nodes/export.go b/count-complete-tree-nodes/export.go
@@ -1,7 +1,9 @@
 package count_complete_tree_nodes
+
 import serialize_and_deserialize_binary_tree "github.com/masx200/leetcode-test/serialize-and-deserialize-binary-tree"
 
 func CountNodes(root *TreeNode) int {
 	return countNodes(root)
 }
-type TreeNode = serialize_and_deserialize_binary_tree.TreeNode
+
+type TreeNode = serialize_and_deserialize_binary_tree.TreeNode
diff --git a/design-skiplist/Skiplist_test.go b/design-skiplist/Skiplist_test.go
@@ -16,6 +16,6 @@ func TestSkiplist(t *testing.T) {
 	assert.Equal(t, false, skiplist.Search(1)) // 返回 false，1 已被擦除
 	skiplist.Add(4)
 	skiplist.Add(4)
-	assert.Equal(t,true, skiplist.Erase(4))
-	assert.Equal(t,true, skiplist.Search(4))
+	assert.Equal(t, true, skiplist.Erase(4))
+	assert.Equal(t, true, skiplist.Search(4))
 }
diff --git a/go.mod b/go.mod
@@ -34,7 +34,7 @@ require (
 	github.com/davecgh/go-spew v1.1.1 // indirect
 	github.com/google/go-cmp v0.5.9 // indirect
 	github.com/magiconair/properties v1.8.7
-	github.com/masx200/leetcode-TreeNode-go v1.0.5 // indirect
+	github.com/masx200/leetcode-TreeNode-go v1.0.5
 	github.com/pmezard/go-difflib v1.0.0 // indirect
 	github.com/webx-top/com v0.9.3
 	gopkg.in/yaml.v3 v3.0.1 // indirect
diff --git a/go.sum b/go.sum
@@ -79,10 +79,6 @@ github.com/magiconair/properties v1.8.7/go.mod h1:Dhd985XPs7jluiymwWYZ0G4Z61jb3v
 github.com/mailru/easyjson v0.0.0-20190312143242-1de009706dbe/go.mod h1:C1wdFJiN94OJF2b5HbByQZoLdCWB1Yqtg26g4irojpc=
 github.com/masx200/leetcode-TreeNode-go v1.0.5 h1:SCl1Ku93oMHWstzjoEa1hkh+gsRu9Lv/9/R9gIUamqI=
 github.com/masx200/leetcode-TreeNode-go v1.0.5/go.mod h1:eIc8UV+ltx46u5IfGFBG/U5CZ4hhWNckYbwykIBClqA=
-github.com/masx200/leetcode-test/serialize-and-deserialize-binary-tree v0.0.0-20221017071457-61edb01aa260 h1:tm7hXj3W0kOvdvS9lUMHn4Ql63nSKifeB7k5ow8OcuI=
-github.com/masx200/leetcode-test/serialize-and-deserialize-binary-tree v0.0.0-20221017071457-61edb01aa260/go.mod h1:nc1u6804gce5vgxkH1Bg5ygDoAc/1AAJKCH0/XCB8/w=
-github.com/masx200/leetcode-test/utils v0.0.0-20221017065832-df73c286eb18 h1:ac2yrYrNQrHrdizousepISR21jpaAeFZKPK8L9Jr2vM=
-github.com/masx200/leetcode-test/utils v0.0.0-20221017065832-df73c286eb18/go.mod h1:taQg1hvh+G8bzv0i78083nfa/i8+e9P8SdDGB/paLws=
 github.com/matttproud/golang_protobuf_extensions v1.0.1/go.mod h1:D8He9yQNgCq6Z5Ld7szi9bcBfOoFv/3dc6xSMkL2PC0=
 github.com/microcosm-cc/bluemonday v1.0.1/go.mod h1:hsXNsILzKxV+sX77C5b8FSuKF00vh2OMYv+xgHpAMF4=
 github.com/modern-go/concurrent v0.0.0-20180228061459-e0a39a4cb421/go.mod h1:6dJC0mAP4ikYIbvyc7fijjWJddQyLn8Ig3JB5CqoB9Q=
diff --git a/maximum-equal-frequency/export.go b/maximum-equal-frequency/export.go
@@ -1,4 +1,4 @@
-package index
+package maximum_equal_frequency
 
 func Max(a, b int) int {
 	return max(a, b)
diff --git a/maximum-equal-frequency/index.go b/maximum-equal-frequency/index.go
@@ -1,4 +1,4 @@
-package index
+package maximum_equal_frequency
 
 func maxEqualFreq(nums []int) (ans int) {
 	freq := map[int]int{}
diff --git a/maximum-product-difference-between-two-pairs/export.go b/maximum-product-difference-between-two-pairs/export.go
@@ -1,4 +1,4 @@
-package index
+package maximum_product_difference_between_two_pairs
 
 func MaxProductDifference(a []int) int {
 	return maxProductDifference(a)
diff --git a/maximum-product-difference-between-two-pairs/index.go b/maximum-product-difference-between-two-pairs/index.go
@@ -1,4 +1,4 @@
-package index
+package maximum_product_difference_between_two_pairs
 
 import "sort"
 
diff --git a/number-of-students-doing-homework-at-a-given-time/export.go b/number-of-students-doing-homework-at-a-given-time/export.go
@@ -1,4 +1,4 @@
-package index
+package number_of_students_doing_homework_at_a_given_time
 
 func BusyStudent(startTime []int, endTime []int, queryTime int) int {
 	return busyStudent(startTime, endTime, queryTime)
diff --git a/number-of-students-doing-homework-at-a-given-time/index.go b/number-of-students-doing-homework-at-a-given-time/index.go
@@ -1,4 +1,4 @@
-package index
+package number_of_students_doing_homework_at_a_given_time
 
 func busyStudent(startTime []int, endTime []int, queryTime int) (ans int) {
 	for i, s := range startTime {
diff --git a/prefix-and-suffix-search/index.go b/prefix-and-suffix-search/index.go
@@ -1,4 +1,4 @@
-package index
+package prefix_and_suffix_search
 
 import "sort"
 
diff --git a/reverse-prefix-of-word/export.go b/reverse-prefix-of-word/export.go
@@ -1,6 +1,5 @@
 package reverse_prefix_of_word
 
-
 func ReversePrefix(word string, ch byte) string {
-	return	reversePrefix(word,ch)
-}
+	return reversePrefix(word, ch)
+}
diff --git a/reverse-prefix-of-word/index.go b/reverse-prefix-of-word/index.go
@@ -1,6 +1,5 @@
 package reverse_prefix_of_word
 
-
 import "strings"
 import "github.com/webx-top/com"
 
diff --git a/serialize-and-deserialize-binary-tree/index.go b/serialize-and-deserialize-binary-tree/index.go
@@ -12,7 +12,7 @@ func Constructor() Codec {
 	return Codec{}
 }
 
-type any=interface{}
+type any = interface{}
 
 func replacer(root *TreeNode) any {
 	if root == nil {
diff --git a/transform-to-chessboard/export.go b/transform-to-chessboard/export.go
@@ -1,4 +1,4 @@
-package index
+package transform_to_chessboard
 
 func MovesToChessboard(board [][]int) int {
 	return movesToChessboard(board)
diff --git a/transform-to-chessboard/index.go b/transform-to-chessboard/index.go
@@ -1,4 +1,4 @@
-package index
+package transform_to_chessboard
 
 func movesToChessboard(board [][]int) int {
 	var (

Original file line number	Diff line number	Diff line change
`@@ -16,6 +16,6 @@ func TestSkiplist(t *testing.T) {`
`16`	`16`	`assert.Equal(t, false, skiplist.Search(1)) // 返回 false，1 已被擦除`
`17`	`17`	`skiplist.Add(4)`
`18`	`18`	`skiplist.Add(4)`
`19`		`- assert.Equal(t,true, skiplist.Erase(4))`
`20`		`- assert.Equal(t,true, skiplist.Search(4))`
	`19`	`+ assert.Equal(t, true, skiplist.Erase(4))`
	`20`	`+ assert.Equal(t, true, skiplist.Search(4))`
`21`	`21`	`}`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package index`
	`1`	`+package maximum_equal_frequency`
`2`	`2`
`3`	`3`	`func Max(a, b int) int {`
`4`	`4`	`return max(a, b)`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package index`
	`1`	`+package maximum_product_difference_between_two_pairs`
`2`	`2`
`3`	`3`	`func MaxProductDifference(a []int) int {`
`4`	`4`	`return maxProductDifference(a)`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package index`
	`1`	`+package number_of_students_doing_homework_at_a_given_time`
`2`	`2`
`3`	`3`	`func BusyStudent(startTime []int, endTime []int, queryTime int) int {`
`4`	`4`	`return busyStudent(startTime, endTime, queryTime)`