From fc2dc45a198f9562fcbefdb399d71482c8c45cd8 Mon Sep 17 00:00:00 2001
From: NevS <1173325467@qq.com>
Date: Thu, 24 Jun 2021 21:41:10 +0800
Subject: [PATCH] =?UTF-8?q?=E5=A2=9E=E5=8A=A0=200617.=E5=90=88=E5=B9=B6?=
 =?UTF-8?q?=E4=BA=8C=E5=8F=89=E6=A0=91=20go=E7=89=88=20=EF=BC=88=E5=A2=9E?=
 =?UTF-8?q?=E5=8A=A0=E5=89=8D=E5=BA=8F=E9=81=8D=E5=8E=86=E7=AE=80=E6=B4=81?=
 =?UTF-8?q?=E7=89=88=E8=A7=A3=E9=A2=98=EF=BC=89?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

增加前序遍历简洁版解题
---
 problems/0617.合并二叉树.md | 14 ++++++++++++++
 1 file changed, 14 insertions(+)

diff --git a/problems/0617.合并二叉树.md b/problems/0617.合并二叉树.md
index 2ff093a3..f325df64 100644
--- a/problems/0617.合并二叉树.md
+++ b/problems/0617.合并二叉树.md
@@ -368,6 +368,20 @@ func mergeTrees(t1 *TreeNode, t2 *TreeNode) *TreeNode {
         Right: mergeTrees(t1.Right,t2.Right)}
     return root
 }
+
+// 前序遍历简洁版
+func mergeTrees(root1 *TreeNode, root2 *TreeNode) *TreeNode {
+    if root1 == nil {
+        return root2
+    }
+    if root2 == nil {
+        return root1
+    }
+    root1.Val += root2.Val
+    root1.Left = mergeTrees(root1.Left, root2.Left)
+    root1.Right = mergeTrees(root1.Right, root2.Right)
+    return root1
+}
 ```
 
 JavaScript: