From 0f6ffd0d1bf7e968b8f730785eb4f3c083e7dfea Mon Sep 17 00:00:00 2001
From: Nixiak-nan <70318059+Nixiak-nan@users.noreply.github.com>
Date: Fri, 6 Aug 2021 13:40:01 +0800
Subject: [PATCH 1/2] =?UTF-8?q?Update=200513.=E6=89=BE=E6=A0=91=E5=B7=A6?=
 =?UTF-8?q?=E4=B8=8B=E8=A7=92=E7=9A=84=E5=80=BC.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

增加题目地址
---
 problems/0513.找树左下角的值.md | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/problems/0513.找树左下角的值.md b/problems/0513.找树左下角的值.md
index 27c6e83c..7e48b53c 100644
--- a/problems/0513.找树左下角的值.md
+++ b/problems/0513.找树左下角的值.md
@@ -9,6 +9,8 @@
 
 ## 513.找树左下角的值
 
+题目地址：[https://leetcode-cn.com/problems/find-bottom-left-tree-value/](https://leetcode-cn.com/problems/find-bottom-left-tree-value/v)
+
 给定一个二叉树，在树的最后一行找到最左边的值。
 
 示例 1:

From adddd296c50504d1a1756aab6d3f15d9f8ae4fc1 Mon Sep 17 00:00:00 2001
From: Nixiak-nan <70318059+Nixiak-nan@users.noreply.github.com>
Date: Sat, 7 Aug 2021 11:20:47 +0800
Subject: [PATCH 2/2] =?UTF-8?q?Update=200236.=E4=BA=8C=E5=8F=89=E6=A0=91?=
 =?UTF-8?q?=E7=9A=84=E6=9C=80=E8=BF=91=E5=85=AC=E5=85=B1=E7=A5=96=E5=85=88?=
 =?UTF-8?q?.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

0236.二叉树的最近公共祖先   java版本中有一个变量没用，删除该变量
---
 problems/0236.二叉树的最近公共祖先.md | 1 -
 1 file changed, 1 deletion(-)

diff --git a/problems/0236.二叉树的最近公共祖先.md b/problems/0236.二叉树的最近公共祖先.md
index 7b5deb56..41e12df4 100644
--- a/problems/0236.二叉树的最近公共祖先.md
+++ b/problems/0236.二叉树的最近公共祖先.md
@@ -249,7 +249,6 @@ class Solution {
 ```java
 // 代码精简版
 class Solution {
-    TreeNode pre;
     public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
         if (root == null || root.val == p.val ||root.val == q.val) return root;
         TreeNode left = lowestCommonAncestor(root.left,p,q);