From 8826f40df26dea97bb40f121e6a175a9e9f8880a Mon Sep 17 00:00:00 2001
From: programmercarl <826123027@qq.com>
Date: Sat, 15 Oct 2022 16:33:50 +0800
Subject: [PATCH] Update

---
 problems/1035.不相交的线.md              |  3 ---
 ....完全二叉树的节点个数Go版本.md | 25 -------------------
 添加559.n叉树的最大深度Go版本.md   | 22 ----------------
 3 files changed, 50 deletions(-)
 delete mode 100644 添加0222.完全二叉树的节点个数Go版本.md
 delete mode 100644 添加559.n叉树的最大深度Go版本.md

diff --git a/problems/1035.不相交的线.md b/problems/1035.不相交的线.md
index 39124675..d97f495a 100644
--- a/problems/1035.不相交的线.md
+++ b/problems/1035.不相交的线.md
@@ -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>
diff --git a/添加0222.完全二叉树的节点个数Go版本.md b/添加0222.完全二叉树的节点个数Go版本.md
deleted file mode 100644
index 6001e7b7..00000000
--- a/添加0222.完全二叉树的节点个数Go版本.md
+++ /dev/null
@@ -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 
-}
-```
-
diff --git a/添加559.n叉树的最大深度Go版本.md b/添加559.n叉树的最大深度Go版本.md
deleted file mode 100644
index 3172837d..00000000
--- a/添加559.n叉树的最大深度Go版本.md
+++ /dev/null
@@ -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 
-}
-```
-