mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-08 00:43:04 +08:00
Update
This commit is contained in:
@ -210,8 +210,5 @@ function maxUncrossedLines(nums1: number[], nums2: number[]): number {
|
||||
};
|
||||
```
|
||||
|
||||
|
||||
|
||||
|
||||
-----------------------
|
||||
<div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>
|
||||
|
@ -1,25 +0,0 @@
|
||||
```go
|
||||
func countNodes(root *TreeNode) int {
|
||||
if root == nil {
|
||||
return 0
|
||||
}
|
||||
q := list.New()
|
||||
q.PushBack(root)
|
||||
res := 0
|
||||
for q.Len() > 0 {
|
||||
n := q.Len()
|
||||
for i := 0; i < n; i++ {
|
||||
node := q.Remove(q.Front()).(*TreeNode)
|
||||
if node.Left != nil {
|
||||
q.PushBack(node.Left)
|
||||
}
|
||||
if node.Right != nil {
|
||||
q.PushBack(node.Right)
|
||||
}
|
||||
res++
|
||||
}
|
||||
}
|
||||
return res
|
||||
}
|
||||
```
|
||||
|
@ -1,22 +0,0 @@
|
||||
```go
|
||||
func maxDepth(root *Node) int {
|
||||
if root == nil {
|
||||
return 0
|
||||
}
|
||||
q := list.New()
|
||||
q.PushBack(root)
|
||||
depth := 0
|
||||
for q.Len() > 0 {
|
||||
n := q.Len()
|
||||
for i := 0; i < n; i++ {
|
||||
node := q.Remove(q.Front()).(*Node)
|
||||
for j := range node.Children {
|
||||
q.PushBack(node.Children[j])
|
||||
}
|
||||
}
|
||||
depth++
|
||||
}
|
||||
return depth
|
||||
}
|
||||
```
|
||||
|
Reference in New Issue
Block a user