feat:提交代码和视频链接

Author: ldtech007

README.md

@@ -98,8 +98,8 @@
 |[leetcode 200.岛屿数量](./leetcode%20blind75/图/LeetCode%200200.岛屿的数量.md)| ✔ | ✔ | ✔ | [岛屿数量](https://www.bilibili.com/video/BV1LUsMezEtq/) | 图 
 |[leetcode 128.最长连续序列](./leetcode%20blind75/图/LeetCode%200128.%20最长连续序列.md)| ✔ | ✔ | ✔ | [最长连续序列](https://www.bilibili.com/video/BV1qqHKetETN/) | 图 
 |[leetcode 57.插入区间](./leetcode%20blind75/区间/LeetCode%200057.插入区间.md)| ✔ | ✔ | ✔ | [插入区间](https://www.bilibili.com/video/BV1VHHUezEw7/) | 区间
-|[leetcode 56.合并区间](./leetcode%20blind75/区间/LeetCode%200056.%20合并区间.md)| ✔ | ✔ | ✔ |  | 区间
-|[leetcode 435.无重叠区间](./leetcode%20blind75/区间/LeetCode%200435.%20无重叠区间.md)| ✔ | ✔ | ✔ |  | 区间
+|[leetcode 56.合并区间](./leetcode%20blind75/区间/LeetCode%200056.%20合并区间.md)| ✔ | ✔ | ✔ | [合并区间](https://www.bilibili.com/video/BV1nVHXehEBC/) | 区间
+|[leetcode 435.无重叠区间](./leetcode%20blind75/区间/LeetCode%200435.%20无重叠区间.md)| ✔ | ✔ | ✔ | [无重叠区间](https://www.bilibili.com/video/BV1N2pLeTEUM/) | 区间
 |[leetcode 206.反转链表](./leetcode%20blind75/链表/LeetCode%200206.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8.md)| ✔ | ✔ | ✔ | [反转链表](https://www.bilibili.com/video/BV1gE421N7W2/) | 链表 
 |[leetcode 141.环形链表](./leetcode%20blind75/链表/LeetCode%200141.%E7%8E%AF%E5%BD%A2%E9%93%BE%E8%A1%A8.md)| ✔ | ✔ | ✔ | [环形链表](https://www.bilibili.com/video/BV18z421q78k/) | 链表 
 |[leetcode 21.合并两个有序链表](./leetcode%20blind75/链表/LeetCode%200021.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E9%93%BE%E8%A1%A8.md)| ✔ | ✔ | ✔ | [合并两个有序链表](https://www.bilibili.com/video/BV17w4m1Y7CJ/) | 链表 
@@ -121,11 +121,11 @@
 |[leetcode 647.回文子串](./leetcode%20blind75/字符串/LeetCode%200647.%20回文子串.md)| ✔ | ✔ | ✔ | [回文子串](https://www.bilibili.com/video/BV1Bs421w7iw/) | 字符串 
 |[leetcode 104.二叉树的最大深度](./leetcode%20blind75/树/LeetCode%200104.%20二叉树的最大深度.md)| ✔ | ✔ | ✔ | [二叉树的最大深度](https://www.bilibili.com/video/BV1MRYHeHEeP/) | 树
 |[leetcode 100.相同的树](./leetcode%20blind75/树/LeetCode%200100.%20相同的树.md) | ✔ | ✔ | ✔ | [相同的树](https://www.bilibili.com/video/BV163Ype6E2L/) | 树
-|[leetcode 226.翻转二叉树](./leetcode%20blind75/树/LeetCode%200226.%20翻转二叉树.md) | ✔ | ✘ | ✘ | [翻转二叉树](https://www.bilibili.com/video/BV1N7YheBE8H/) | 树
+|[leetcode 226.翻转二叉树](./leetcode%20blind75/树/LeetCode%200226.%20翻转二叉树.md) | ✔ | ✔ | ✔ | [翻转二叉树](https://www.bilibili.com/video/BV1N7YheBE8H/) | 树
 |[leetcode 124.二叉树中的最大路径和](./leetcode%20blind75/树/LeetCode%200124.%20二叉树中的最大路径和.md) | ✔ | ✘ | ✘ | [二叉树中的最大路径和](https://www.bilibili.com/video/BV12FYee2Eg6/) | 树
 |[leetcode 102.二叉树的层序遍历](./leetcode%20blind75/树/LeetCode%200102.%20二叉树的层序遍历.md) | ✔ | ✔ | ✔ | [二叉树的层序遍历](https://www.bilibili.com/video/BV1MNeceFE1h/) | 树
 |[leetcode 297.二叉树的序列化与反序列化](./leetcode%20blind75/树/LeetCode%200297.%20二叉树的序列化与反序列化.md) | ✔ | ✘ | ✘ | [二叉树的序列化与反序列化](https://www.bilibili.com/video/BV1TTeceoECg/) | 树
-|[leetcode 572.另一棵树的子树](./leetcode%20blind75/树/LeetCode%200572.%20另一棵树的子树.md) | ✔ | ✘ | ✘ | [另一棵树的子树](https://www.bilibili.com/video/BV1BseceLE6R/) | 树
+|[leetcode 572.另一棵树的子树](./leetcode%20blind75/树/LeetCode%200572.%20另一棵树的子树.md) | ✔ | ✔ | ✔ | [另一棵树的子树](https://www.bilibili.com/video/BV1BseceLE6R/) | 树
 |[leetcode 105.从前序与中序遍历序列构造二叉树](./leetcode%20blind75/树/LeetCode%200105.%20从前序与中序遍历序列构造二叉树.md) | ✔ | ✘ | ✘ | [从前序与中序遍历序列构造二叉树](https://www.bilibili.com/video/BV1XAYke2ETp/) | 树
 |[leetcode 98.验证二叉搜索树](./leetcode%20blind75/树/LeetCode%200098.%20验证二叉搜索树.md) | ✔ | ✔ | ✔ | [验证二叉搜索树](https://www.bilibili.com/video/BV1zVe7eoEiu/) | 树
 |[leetcode 230.二叉搜索树中第K小的元素](./leetcode%20blind75/树/LeetCode%200230.%20二叉搜索树中第K小的元素.md) | ✔ | ✘ | ✘ | [二叉搜索树中第K小的元素](https://www.bilibili.com/video/BV1DseseYE38/) | 树

leetcode blind75/区间/LeetCode 0056. 合并区间.md

@@ -1,4 +1,6 @@
 > *题目链接：* https://leetcode.cn/problems/merge-intervals/
+>
+>*视频题解：* https://www.bilibili.com/video/BV1nVHXehEBC/
 
 # LeetCode 56. 合并区间
 

leetcode blind75/区间/LeetCode 0435. 无重叠区间.md

@@ -1,4 +1,6 @@
 > *题目链接：*  https://leetcode.cn/problems/non-overlapping-intervals/
+>
+>*视频题解：* https://www.bilibili.com/video/BV1N2pLeTEUM/
 
 # LeetCode 435. 无重叠区间
 

leetcode blind75/树/LeetCode 0226. 翻转二叉树.md

@@ -62,6 +62,69 @@ public:
     }
 };
 ```
+## java代码
+
+```java
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode() {}
+ *     TreeNode(int val) { this.val = val; }
+ *     TreeNode(int val, TreeNode left, TreeNode right) {
+ *         this.val = val;
+ *         this.left = left;
+ *         this.right = right;
+ *     }
+ * }
+ */
+class Solution {
+    public TreeNode invertTree(TreeNode root) {
+        if (root == null) {  // 如果节点为空，返回该节点
+            return root;
+        }
+
+        // 递归地翻转左子树和右子树
+        root.left = invertTree(root.left);
+        root.right = invertTree(root.right);
+
+        // 交换左子树和右子树
+        TreeNode tmp = root.left;
+        root.left = root.right;
+        root.right = tmp;
+
+        return root;
+    }
+}
+```
+
+## python代码
+
+```python
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:
+        if not root:  # 如果节点为空，返回该节点
+            return root
+
+        # 递归地翻转左子树和右子树
+        root.left = self.invertTree(root.left)
+        root.right = self.invertTree(root.right)
+
+        # 交换左子树和右子树
+        tmp = root.left
+        root.left = root.right
+        root.right = tmp
+        
+        return root
+```
 
 ## 复杂度分析
 

leetcode blind75/树/LeetCode 0572. 另一棵树的子树.md

@@ -74,6 +74,85 @@ public:
 };
 ```
 
+## java代码
+
+```java
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode() {}
+ *     TreeNode(int val) { this.val = val; }
+ *     TreeNode(int val, TreeNode left, TreeNode right) {
+ *         this.val = val;
+ *         this.left = left;
+ *         this.right = right;
+ *     }
+ * }
+ */
+class Solution {
+    public boolean isSubtree(TreeNode root, TreeNode subRoot) {
+          // 递归结束的条件，空节点null是任意树的子树
+        if (subRoot == null) return true;
+        // 递归结束的条件，此时subRoot不为null
+        if (root == null) return false;
+        // 递归结束的条件
+        if (isSameTree(root, subRoot)) return true;
+        // 子问题
+        return isSubtree(root.left, subRoot) || isSubtree(root.right, subRoot);
+    }
+
+    public boolean isSameTree(TreeNode p, TreeNode q) {
+        // 递归结束的条件
+        if (p == null && q == null) {
+            return true;
+        }
+        // 递归结束的条件
+        if (p == null || q == null || p.val != q.val) {
+            return false;
+        }
+        // 子问题
+        return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
+    }
+}
+```
+
+## python代码
+
+```python
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def isSubtree(self, root: Optional[TreeNode], subRoot: Optional[TreeNode]) -> bool:
+         # 递归结束的条件，空节点None是任意树的子树
+        if not subRoot:
+            return True
+        # 递归结束的条件，此时subRoot不为None
+        if not root:
+            return False
+        # 递归结束的条件
+        if self.isSameTree(root, subRoot):
+            return True
+        # 子问题
+        return self.isSubtree(root.left, subRoot) or self.isSubtree(root.right, subRoot)
+
+    def isSameTree(self, p: TreeNode, q: TreeNode) -> bool:
+        # 递归结束的条件
+        if not p and not q:
+            return True
+        # 递归结束的条件
+        if not p or not q or p.val != q.val:
+            return False
+        # 子问题
+        return self.isSameTree(p.left, q.left) and self.isSameTree(p.right, q.right)
+```
+
 ## 复杂度分析
 
 **时间复杂度：** 由于`s`的每一个节点都要与`t`进行去匹配，所以时间复杂度为 *O(ST)*，其中`S`为`s`的节点数量，`T`为`t`的节点数量。