From 3ca41116acf4203d79686b40ee6478f52ff28c54 Mon Sep 17 00:00:00 2001
From: QuinnDK <39618652+QuinnDK@users.noreply.github.com>
Date: Sun, 16 May 2021 16:22:32 +0800
Subject: [PATCH] =?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.二叉树的最近公共祖先.md    | 29 ++++++++++++++++++-
 1 file changed, 28 insertions(+), 1 deletion(-)

diff --git a/problems/0236.二叉树的最近公共祖先.md b/problems/0236.二叉树的最近公共祖先.md
index 69127bd9..3233c6a1 100644
--- a/problems/0236.二叉树的最近公共祖先.md
+++ b/problems/0236.二叉树的最近公共祖先.md
@@ -266,7 +266,34 @@ Python：
 
 
 Go：
+```Go
+func lowestCommonAncestor(root, p, q *TreeNode) *TreeNode {
+    // check
+    if root == nil {
+        return root
+    }
+    // 相等 直接返回root节点即可
+    if root == p || root == q {
+        return root
+    }
+    // Divide
+    left := lowestCommonAncestor(root.Left, p, q)
+    right := lowestCommonAncestor(root.Right, p, q)
 
+    // Conquer
+    // 左右两边都不为空，则根节点为祖先
+    if left != nil && right != nil {
+        return root
+    }
+    if left != nil {
+        return left
+    }
+    if right != nil {
+        return right
+    }
+    return nil
+}
+```
 
 
 
@@ -274,4 +301,4 @@ Go：
 * 作者微信：[程序员Carl](https://mp.weixin.qq.com/s/b66DFkOp8OOxdZC_xLZxfw)
 * B站视频：[代码随想录](https://space.bilibili.com/525438321)
 * 知识星球：[代码随想录](https://mp.weixin.qq.com/s/QVF6upVMSbgvZy8lHZS3CQ)
-<div align="center"><img src=../pics/公众号.png width=450 alt=> </img></div>
\ No newline at end of file
+<div align="center"><img src=../pics/公众号.png width=450 alt=> </img></div>