algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-06 01:15:57 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add go module in root directory

Browse Source
This commit is contained in:
halfrost
2022-09-10 16:41:11 -07:00
parent e2a72e6212
commit 9437625832
270 changed files with 319 additions and 271 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
go.mod
View File

@ -3,8 +3,18 @@ module github.com/halfrost/LeetCode-Go
go 1.19
require (
github.com/BurntSushi/toml v1.2.0 // indirect
github.com/inconshreveable/mousetrap v1.0.0 // indirect
github.com/spf13/cobra v1.5.0 // indirect
github.com/spf13/pflag v1.0.5 // indirect
github.com/BurntSushi/toml v1.2.0
github.com/halfrost/LeetCode-Go/structures v0.0.0-20220910233101-aa0e2c897b18
github.com/halfrost/LeetCode-Go/template v0.0.0-20220910233504-e2a72e6212ce
github.com/mozillazg/request v0.8.0
github.com/spf13/cobra v1.5.0
)
require (
github.com/bitly/go-simplejson v0.5.0 // indirect
github.com/bmizerany/assert v0.0.0-20160611221934-b7ed37b82869 // indirect
github.com/inconshreveable/mousetrap v1.0.0 // indirect
github.com/kr/pretty v0.3.0 // indirect
github.com/spf13/pflag v1.0.5 // indirect
golang.org/x/net v0.0.0-20220909164309-bea034e7d591 // indirect
)

28
go.sum
View File

@ -1,12 +1,40 @@
github.com/BurntSushi/toml v1.2.0 h1:Rt8g24XnyGTyglgET/PRUNlrUeu9F5L+7FilkXfZgs0=
github.com/BurntSushi/toml v1.2.0/go.mod h1:CxXYINrC8qIiEnFrOxCa7Jy5BFHlXnUU2pbicEuybxQ=
github.com/bitly/go-simplejson v0.5.0 h1:6IH+V8/tVMab511d5bn4M7EwGXZf9Hj6i2xSwkNEM+Y=
github.com/bitly/go-simplejson v0.5.0/go.mod h1:cXHtHw4XUPsvGaxgjIAn8PhEWG9NfngEKAMDJEczWVA=
github.com/bmizerany/assert v0.0.0-20160611221934-b7ed37b82869 h1:DDGfHa7BWjL4YnC6+E63dPcxHo2sUxDIu8g3QgEJdRY=
github.com/bmizerany/assert v0.0.0-20160611221934-b7ed37b82869/go.mod h1:Ekp36dRnpXw/yCqJaO+ZrUyxD+3VXMFFr56k5XYrpB4=
github.com/cpuguy83/go-md2man/v2 v2.0.2/go.mod h1:tgQtvFlXSQOSOSIRvRPT7W67SCa46tRHOmNcaadrF8o=
github.com/creack/pty v1.1.9/go.mod h1:oKZEueFk5CKHvIhNR5MUki03XCEU+Q6VDXinZuGJ33E=
github.com/davecgh/go-spew v1.1.1 h1:vj9j/u1bqnvCEfJOwUhtlOARqs3+rkHYY13jYWTU97c=
github.com/halfrost/LeetCode-Go/structures v0.0.0-20220910233101-aa0e2c897b18 h1:0GpuK4ECz6Q5AznkgjU2ZhxfqXyU5lt7wmzm7R0GyuA=
github.com/halfrost/LeetCode-Go/structures v0.0.0-20220910233101-aa0e2c897b18/go.mod h1:PiB3scEe5vQhgf3BFfrj/wwApeH+2yyPRF3Jqpq+7AY=
github.com/halfrost/LeetCode-Go/template v0.0.0-20220910233504-e2a72e6212ce h1:JQkZW/93bYrrUhM2xh4qLSZAXfw3DXQ15bfXis5TGpI=
github.com/halfrost/LeetCode-Go/template v0.0.0-20220910233504-e2a72e6212ce/go.mod h1:Jiujq5ltPAr2X9Aw8KYqm8nzL02b73UtrVhryu383ag=
github.com/inconshreveable/mousetrap v1.0.0 h1:Z8tu5sraLXCXIcARxBp/8cbvlwVa7Z1NHg9XEKhtSvM=
github.com/inconshreveable/mousetrap v1.0.0/go.mod h1:PxqpIevigyE2G7u3NXJIT2ANytuPF1OarO4DADm73n8=
github.com/kr/pretty v0.1.0/go.mod h1:dAy3ld7l9f0ibDNOQOHHMYYIIbhfbHSm3C4ZsoJORNo=
github.com/kr/pretty v0.3.0 h1:WgNl7dwNpEZ6jJ9k1snq4pZsg7DOEN8hP9Xw0Tsjwk0=
github.com/kr/pretty v0.3.0/go.mod h1:640gp4NfQd8pI5XOwp5fnNeVWj67G7CFk/SaSQn7NBk=
github.com/kr/pty v1.1.1/go.mod h1:pFQYn66WHrOpPYNljwOMqo10TkYh1fy3cYio2l3bCsQ=
github.com/kr/text v0.1.0/go.mod h1:4Jbv+DJW3UT/LiOwJeYQe1efqtUx/iVham/4vfdArNI=
github.com/kr/text v0.2.0 h1:5Nx0Ya0ZqY2ygV366QzturHI13Jq95ApcVaJBhpS+AY=
github.com/kr/text v0.2.0/go.mod h1:eLer722TekiGuMkidMxC/pM04lWEeraHUUmBw8l2grE=
github.com/mozillazg/request v0.8.0 h1:TbXeQUdBWr1J1df5Z+lQczDFzX9JD71kTCl7Zu/9rNM=
github.com/mozillazg/request v0.8.0/go.mod h1:weoQ/mVFNbWgRBtivCGF1tUT9lwneFesues+CleXMWc=
github.com/pmezard/go-difflib v1.0.0 h1:4DBwDE0NGyQoBHbLQYPwSUPoCMWR5BEzIk/f1lZbAQM=
github.com/rogpeppe/go-internal v1.6.1 h1:/FiVV8dS/e+YqF2JvO3yXRFbBLTIuSDkuC7aBOAvL+k=
github.com/rogpeppe/go-internal v1.6.1/go.mod h1:xXDCJY+GAPziupqXw64V24skbSoqbTEfhy4qGm1nDQc=
github.com/russross/blackfriday/v2 v2.1.0/go.mod h1:+Rmxgy9KzJVeS9/2gXHxylqXiyQDYRxCVz55jmeOWTM=
github.com/spf13/cobra v1.5.0 h1:X+jTBEBqF0bHN+9cSMgmfuvv2VHJ9ezmFNf9Y/XstYU=
github.com/spf13/cobra v1.5.0/go.mod h1:dWXEIy2H428czQCjInthrTRUg7yKbok+2Qi/yBIJoUM=
github.com/spf13/pflag v1.0.5 h1:iy+VFUOCP1a+8yFto/drg2CJ5u0yRoB7fZw3DKv/JXA=
github.com/spf13/pflag v1.0.5/go.mod h1:McXfInJRrz4CZXVZOBLb0bTZqETkiAhM9Iw0y3An2Bg=
github.com/stretchr/testify v1.8.0 h1:pSgiaMZlXftHpm5L7V1+rVB+AZJydKsMxsQBIJw4PKk=
golang.org/x/net v0.0.0-20220909164309-bea034e7d591 h1:D0B/7al0LLrVC8aWF4+oxpv/m8bc7ViFfVS8/gXGdqI=
golang.org/x/net v0.0.0-20220909164309-bea034e7d591/go.mod h1:YDH+HFinaLZZlnHAfSS6ZXJJ9M9t4Dl22yv3iI2vPwk=
gopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=
gopkg.in/check.v1 v1.0.0-20180628173108-788fd7840127/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=
gopkg.in/errgo.v2 v2.1.0/go.mod h1:hNsd1EY+bozCKY1Ytp96fpM3vjJbqLJn88ws8XvfDNI=
gopkg.in/yaml.v2 v2.4.0/go.mod h1:RDklbk79AGWmwhnvt/jBztapEOGDOx6ZbXqjP6csGnQ=
gopkg.in/yaml.v3 v3.0.1 h1:fxVm/GzAzEWqLHuvctI91KS9hhNmmWOoWu0XTYJS7CA=

2
leetcode/0002.Add-Two-Numbers/2. Add Two Numbers.go
View File

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

2
leetcode/0002.Add-Two-Numbers/2. Add Two Numbers_test.go
View File

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

2
leetcode/0019.Remove-Nth-Node-From-End-of-List/19. Remove Nth Node From End of List.go
View File

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

2
leetcode/0019.Remove-Nth-Node-From-End-of-List/19. Remove Nth Node From End of List_test.go
View File

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

2
leetcode/0021.Merge-Two-Sorted-Lists/21. Merge Two Sorted Lists.go
View File

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

2
leetcode/0021.Merge-Two-Sorted-Lists/21. Merge Two Sorted Lists_test.go
View File

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

2
leetcode/0023.Merge-k-Sorted-Lists/23. Merge k Sorted Lists.go
View File

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

2
leetcode/0023.Merge-k-Sorted-Lists/23. Merge k Sorted Lists_test.go
View File

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

2
leetcode/0024.Swap-Nodes-in-Pairs/24. Swap Nodes in Pairs.go
View File

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

2
leetcode/0024.Swap-Nodes-in-Pairs/24. Swap Nodes in Pairs_test.go
View File

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

2
leetcode/0025.Reverse-Nodes-in-k-Group/25. Reverse Nodes in k Group.go
View File

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

2
leetcode/0025.Reverse-Nodes-in-k-Group/25. Reverse Nodes in k Group_test.go
View File

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

2
leetcode/0056.Merge-Intervals/56. Merge Intervals.go
View File

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

2
leetcode/0057.Insert-Interval/57. Insert Interval.go
View File

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

2
leetcode/0061.Rotate-List/61. Rotate List.go
View File

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

2
leetcode/0061.Rotate-List/61. Rotate List_test.go
View File

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

2
leetcode/0082.Remove-Duplicates-from-Sorted-List-II/82. Remove Duplicates from Sorted List II.go
View File

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

2
leetcode/0082.Remove-Duplicates-from-Sorted-List-II/82. Remove Duplicates from Sorted List II_test.go
View File

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

2
leetcode/0083.Remove-Duplicates-from-Sorted-List/83. Remove Duplicates from Sorted List.go
View File

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

2
leetcode/0083.Remove-Duplicates-from-Sorted-List/83. Remove Duplicates from Sorted List_test.go
View File

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

2
leetcode/0086.Partition-List/86. Partition List.go
View File

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

2
leetcode/0086.Partition-List/86. Partition List_test.go
View File

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

2
leetcode/0092.Reverse-Linked-List-II/92. Reverse Linked List II.go
View File

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

2
leetcode/0092.Reverse-Linked-List-II/92. Reverse Linked List II_test.go
View File

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

2
leetcode/0094.Binary-Tree-Inorder-Traversal/94. Binary Tree Inorder Traversal.go
View File

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

2
leetcode/0094.Binary-Tree-Inorder-Traversal/94. Binary Tree Inorder Traversal_test.go
View File

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

2
leetcode/0095.Unique-Binary-Search-Trees-II/95. Unique Binary Search Trees II.go
View File

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

2
leetcode/0095.Unique-Binary-Search-Trees-II/95. Unique Binary Search Trees II_test.go
View File

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

2
leetcode/0098.Validate-Binary-Search-Tree/98. Validate Binary Search Tree.go
View File

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

2
leetcode/0098.Validate-Binary-Search-Tree/98. Validate Binary Search Tree_test.go
View File

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

2
leetcode/0099.Recover-Binary-Search-Tree/99. Recover Binary Search Tree.go
View File

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

2
leetcode/0099.Recover-Binary-Search-Tree/99. Recover Binary Search Tree_test.go
View File

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

2
leetcode/0100.Same-Tree/100. Same Tree.go
View File

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

2
leetcode/0100.Same-Tree/100. Same Tree_test.go
View File

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

2
leetcode/0101.Symmetric-Tree/101. Symmetric Tree.go
View File

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

2
leetcode/0101.Symmetric-Tree/101. Symmetric Tree_test.go
View File

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

2
leetcode/0102.Binary-Tree-Level-Order-Traversal/102. Binary Tree Level Order Traversal.go
View File

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

2
leetcode/0102.Binary-Tree-Level-Order-Traversal/102. Binary Tree Level Order Traversal_test.go
View File

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

2
leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal/103. Binary Tree Zigzag Level Order Traversal.go
View File

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

2
leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal/103. Binary Tree Zigzag Level Order Traversal_test.go
View File

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

2
leetcode/0104.Maximum-Depth-of-Binary-Tree/104. Maximum Depth of Binary Tree.go
View File

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

2
leetcode/0104.Maximum-Depth-of-Binary-Tree/104. Maximum Depth of Binary Tree_test.go
View File

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

2
leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/105. Construct Binary Tree from Preorder and Inorder Traversal.go
View File

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

2
leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/105. Construct Binary Tree from Preorder and Inorder Traversal_test.go
View File

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

2
leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/106. Construct Binary Tree from Inorder and Postorder Traversal.go
View File

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

2
leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/106. Construct Binary Tree from Inorder and Postorder Traversal_test.go
View File

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

2
leetcode/0107.Binary-Tree-Level-Order-Traversal-II/107. Binary Tree Level Order Traversal II.go
View File

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

2
leetcode/0107.Binary-Tree-Level-Order-Traversal-II/107. Binary Tree Level Order Traversal II_test.go
View File

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

2
leetcode/0108.Convert-Sorted-Array-to-Binary-Search-Tree/108. Convert Sorted Array to Binary Search Tree.go
View File

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

2
leetcode/0108.Convert-Sorted-Array-to-Binary-Search-Tree/108. Convert Sorted Array to Binary Search Tree_test.go
View File

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

2
leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree/109. Convert Sorted List to Binary Search Tree.go
View File

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

2
leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree/109. Convert Sorted List to Binary Search Tree_test.go
View File

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

2
leetcode/0110.Balanced-Binary-Tree/110. Balanced Binary Tree.go
View File

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

2
leetcode/0110.Balanced-Binary-Tree/110. Balanced Binary Tree_test.go
View File

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

2
leetcode/0111.Minimum-Depth-of-Binary-Tree/111. Minimum Depth of Binary Tree.go
View File

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

2
leetcode/0111.Minimum-Depth-of-Binary-Tree/111. Minimum Depth of Binary Tree_test.go
View File

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

2
leetcode/0112.Path-Sum/112. Path Sum.go
View File

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

2
leetcode/0112.Path-Sum/112. Path Sum_test.go
View File

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

2
leetcode/0113.Path-Sum-II/113. Path Sum II.go
View File

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

2
leetcode/0113.Path-Sum-II/113. Path Sum II_test.go
View File

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

2
leetcode/0114.Flatten-Binary-Tree-to-Linked-List/114. Flatten Binary Tree to Linked List.go
View File

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

2
leetcode/0114.Flatten-Binary-Tree-to-Linked-List/114. Flatten Binary Tree to Linked List_test.go
View File

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

2
leetcode/0124.Binary-Tree-Maximum-Path-Sum/124. Binary Tree Maximum Path Sum.go
View File

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

2
leetcode/0124.Binary-Tree-Maximum-Path-Sum/124. Binary Tree Maximum Path Sum_test.go
View File

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

2
leetcode/0128.Longest-Consecutive-Sequence/128. Longest Consecutive Sequence.go
View File

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

2
leetcode/0129.Sum-Root-to-Leaf-Numbers/129. Sum Root to Leaf Numbers.go
View File

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

2
leetcode/0129.Sum-Root-to-Leaf-Numbers/129. Sum Root to Leaf Numbers_test.go
View File

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

2
leetcode/0130.Surrounded-Regions/130. Surrounded Regions.go
View File

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

2
leetcode/0138.Copy-List-With-Random-Pointer/138. Copy List With Random Pointer_test.go
View File

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

2
leetcode/0141.Linked-List-Cycle/141. Linked List Cycle.go
View File

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

2
leetcode/0141.Linked-List-Cycle/141. Linked List Cycle_test.go
View File

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

2
leetcode/0142.Linked-List-Cycle-II/142. Linked List Cycle II.go
View File

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

2
leetcode/0143.Reorder-List/143. Reorder List.go
View File

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

2
leetcode/0143.Reorder-List/143. Reorder List_test.go
View File

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

2
leetcode/0144.Binary-Tree-Preorder-Traversal/144. Binary Tree Preorder Traversal.go
View File

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

2
leetcode/0144.Binary-Tree-Preorder-Traversal/144. Binary Tree Preorder Traversal_test.go
View File

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

2
leetcode/0145.Binary-Tree-Postorder-Traversal/145. Binary Tree Postorder Traversal.go
View File

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

2
leetcode/0145.Binary-Tree-Postorder-Traversal/145. Binary Tree Postorder Traversal_test.go
View File

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

2
leetcode/0147.Insertion-Sort-List/147. Insertion Sort List.go
View File

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

2
leetcode/0147.Insertion-Sort-List/147. Insertion Sort List_test.go
View File

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

2
leetcode/0148.Sort-List/148. Sort List.go
View File

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

2
leetcode/0148.Sort-List/148. Sort List_test.go
View File

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

2
leetcode/0160.Intersection-of-Two-Linked-Lists/160. Intersection of Two Linked Lists.go
View File

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

2
leetcode/0160.Intersection-of-Two-Linked-Lists/160. Intersection of Two Linked Lists_test.go
View File

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

2
leetcode/0173.Binary-Search-Tree-Iterator/173. Binary Search Tree Iterator.go
View File

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

2
leetcode/0173.Binary-Search-Tree-Iterator/173. Binary Search Tree Iterator_test.go
View File

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

2
leetcode/0199.Binary-Tree-Right-Side-View/199. Binary Tree Right Side View.go
View File

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

2
leetcode/0199.Binary-Tree-Right-Side-View/199. Binary Tree Right Side View_test.go
View File

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

2
leetcode/0203.Remove-Linked-List-Elements/203. Remove Linked List Elements.go
View File

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

2
leetcode/0203.Remove-Linked-List-Elements/203. Remove Linked List Elements_test.go
View File

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

2
leetcode/0206.Reverse-Linked-List/206. Reverse Linked List.go
View File

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

2
leetcode/0206.Reverse-Linked-List/206. Reverse Linked List_test.go
View File

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

2
leetcode/0218.The-Skyline-Problem/218. The Skyline Problem.go
View File

@ -3,7 +3,7 @@ package leetcode
import (
"sort"
"github.com/halfrost/leetcode-go/template"
"github.com/halfrost/LeetCode-Go/template"
)
// 解法一 树状数组，时间复杂度 O(n log n)

2
leetcode/0222.Count-Complete-Tree-Nodes/222. Count Complete Tree Nodes.go
View File

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

2
leetcode/0222.Count-Complete-Tree-Nodes/222. Count Complete Tree Nodes_test.go
View File

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

2
leetcode/0226.Invert-Binary-Tree/226. Invert Binary Tree.go
View File

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

2
leetcode/0226.Invert-Binary-Tree/226. Invert Binary Tree_test.go
View File

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

2
leetcode/0230.Kth-Smallest-Element-in-a-BST/230. Kth Smallest Element in a BST.go
View File

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

Some files were not shown because too many files have changed in this diff Show More