From 0c6514def0c32c600b5e4a013d509b0f52900afe Mon Sep 17 00:00:00 2001
From: huangge1199 <huangge1199@hotmail.com>
Date: Wed, 30 Jun 2021 09:43:28 +0800
Subject: [PATCH] =?UTF-8?q?=E5=89=91=E6=8C=87=20Offer=2037:=E5=BA=8F?=
 =?UTF-8?q?=E5=88=97=E5=8C=96=E4=BA=8C=E5=8F=89=E6=A0=91?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../editor/cn/XuLieHuaErChaShuLcof.java       | 93 +++++++++++++++++++
 .../editor/cn/XuLieHuaErChaShuLcof.md         | 19 ++++
 2 files changed, 112 insertions(+)
 create mode 100644 src/main/java/leetcode/editor/cn/XuLieHuaErChaShuLcof.java
 create mode 100644 src/main/java/leetcode/editor/cn/XuLieHuaErChaShuLcof.md

diff --git a/src/main/java/leetcode/editor/cn/XuLieHuaErChaShuLcof.java b/src/main/java/leetcode/editor/cn/XuLieHuaErChaShuLcof.java
new file mode 100644
index 0000000..80d33f1
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/XuLieHuaErChaShuLcof.java
@@ -0,0 +1,93 @@
+//请实现两个函数，分别用来序列化和反序列化二叉树。 
+//
+// 你需要设计一个算法来实现二叉树的序列化与反序列化。这里不限定你的序列 / 反序列化算法执行逻辑，你只需要保证一个二叉树可以被序列化为一个字符串并且将这个字
+//符串反序列化为原始的树结构。 
+//
+// 提示：输入输出格式与 LeetCode 目前使用的方式一致，详情请参阅 LeetCode 序列化二叉树的格式。你并非必须采取这种方式，你也可以采用其他的方
+//法解决这个问题。 
+//
+// 
+//
+// 示例： 
+//
+// 
+//输入：root = [1,2,3,null,null,4,5]
+//输出：[1,2,3,null,null,4,5]
+// 
+//
+// 
+//
+// 注意：本题与主站 297 题相同：https://leetcode-cn.com/problems/serialize-and-deserialize-b
+//inary-tree/ 
+// Related Topics 树 深度优先搜索 广度优先搜索 设计 字符串 二叉树 
+// 👍 175 👎 0
+
+package leetcode.editor.cn;
+
+import com.code.leet.entiy.TreeNode;
+
+import java.util.LinkedList;
+import java.util.Queue;
+
+//剑指 Offer 37:序列化二叉树
+public class XuLieHuaErChaShuLcof{
+    public static void main(String[] args) {
+        //测试代码
+//        Solution solution = new XuLieHuaErChaShuLcof().new Solution();
+    }
+    //力扣代码
+    //leetcode submit region begin(Prohibit modification and deletion)
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode(int x) { val = x; }
+ * }
+ */
+public class Codec {
+
+    // Encodes a tree to a single string.
+    public String serialize(TreeNode root) {
+        String result = "";
+        if (root == null) {
+            return "null,";
+        }
+        result += root.val + ",";
+        result += serialize(root.left);
+        result += serialize(root.right);
+        return result;
+    }
+
+    // Decodes your encoded data to tree.
+    public TreeNode deserialize(String data) {
+        if ("null,".equals(data)) {
+            return null;
+        }
+        String[] strs = data.split(",");
+        Queue<String> queue = new LinkedList<>();
+        for (String str : strs) {
+            queue.offer(str);
+        }
+        return des(queue);
+    }
+
+    private TreeNode des(Queue<String> queue) {
+        String value = queue.poll();
+        if ("null".equals(value)) {
+            return null;
+        }
+        TreeNode root = new TreeNode(Integer.parseInt(value));
+        root.left = des(queue);
+        root.right = des(queue);
+        return root;
+    }
+}
+
+// Your Codec object will be instantiated and called as such:
+// Codec codec = new Codec();
+// codec.deserialize(codec.serialize(root));
+//leetcode submit region end(Prohibit modification and deletion)
+
+}
\ No newline at end of file
diff --git a/src/main/java/leetcode/editor/cn/XuLieHuaErChaShuLcof.md b/src/main/java/leetcode/editor/cn/XuLieHuaErChaShuLcof.md
new file mode 100644
index 0000000..21100d1
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/XuLieHuaErChaShuLcof.md
@@ -0,0 +1,19 @@
+<p>请实现两个函数，分别用来序列化和反序列化二叉树。</p>
+
+<p>你需要设计一个算法来实现二叉树的序列化与反序列化。这里不限定你的序列 / 反序列化算法执行逻辑，你只需要保证一个二叉树可以被序列化为一个字符串并且将这个字符串反序列化为原始的树结构。</p>
+
+<p><strong>提示：</strong>输入输出格式与 LeetCode 目前使用的方式一致，详情请参阅 <a href="/faq/#binary-tree">LeetCode 序列化二叉树的格式</a>。你并非必须采取这种方式，你也可以采用其他的方法解决这个问题。</p>
+
+<p> </p>
+
+<p><strong>示例：</strong></p>
+<img alt="" src="https://assets.leetcode.com/uploads/2020/09/15/serdeser.jpg" style="width: 442px; height: 324px;" />
+<pre>
+<strong>输入：</strong>root = [1,2,3,null,null,4,5]
+<strong>输出：</strong>[1,2,3,null,null,4,5]
+</pre>
+
+<p> </p>
+
+<p>注意：本题与主站 297 题相同：<a href="https://leetcode-cn.com/problems/serialize-and-deserialize-binary-tree/">https://leetcode-cn.com/problems/serialize-and-deserialize-binary-tree/</a></p>
+<div><div>Related Topics</div><div><li>树</li><li>深度优先搜索</li><li>广度优先搜索</li><li>设计</li><li>字符串</li><li>二叉树</li></div></div>\n<div><li>👍 175</li><li>👎 0</li></div>
\ No newline at end of file