297. Serialize and Deserialize Binary Tree

focusj 發(fā)布于2019-08-14 14:15 / 2030人閱讀

摘要：題目解答用一個特殊的符號來表示的情況這是按先序遍歷來存到中去這里用為其包含了幾乎所有這里還是挺多知識點的，后是一個可以把數(shù)組變成則是把加到這個的中去

題目：
Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment.

Design an algorithm to serialize and deserialize a binary tree. There is no restriction on how your serialization/deserialization algorithm should work. You just need to ensure that a binary tree can be serialized to a string and this string can be deserialized to the original tree structure.

For example, you may serialize the following tree

as "[1,2,3,null,null,4,5]", just the same as how LeetCode OJ serializes a binary tree. You do not necessarily need to follow this format, so please be creative and come up with different approaches yourself.
Note: Do not use class member/global/static variables to store states. Your serialize and deserialize algorithms should be stateless.

解答：

public class Codec {
    private String spliter = ",";
    //用一個特殊的符號來表示null的情況
    private String NN = "X";

    // Encodes a tree to a single string.
    public void BuildString(StringBuilder sb, TreeNode root) {
        if (root == null) {
            sb.append("X").append(spliter);
        } else {
            //這是按先序遍歷來存root到string中去
            sb.append(root.val).append(spliter);
            BuildString(sb, root.left);
            BuildString(sb, root.right);
        }
    }
    
    public String serialize(TreeNode root) {
        StringBuilder sb = new StringBuilder();
        BuildString(sb, root);
        return sb.toString();
    }

    // Decodes your encoded data to tree.
    public TreeNode BuildTree(Deque nodes) {
        String node = nodes.remove();
        if (node.equals(NN)) {
            return null;
        } else {
            //Integer.valueOf("String");
            TreeNode root = new TreeNode(Integer.valueOf(node));
            root.left = BuildTree(nodes);
            root.right = BuildTree(nodes);
            return root;
        }
    }
    
    public TreeNode deserialize(String data) {
        //deque這里用linkedlist為interface,其包含了幾乎所有resizable array
        Deque nodes = new LinkedList<>();
        //這里還是挺多知識點的，String.split()后是一個String[], Arrays.asList()可以把數(shù)組變成list, nodes.addAll()則是把list加到nodes這個list的中去
        nodes.addAll(Arrays.asList(data.split(spliter)));
        return BuildTree(nodes);
    }
}

// Your Codec object will be instantiated and called as such:
// Codec codec = new Codec();
// codec.deserialize(codec.serialize(root));

云服務器 GPU云服務器 binary-tree binary-search-tree Deserialize serialize

文章版權歸作者所有，未經(jīng)允許請勿轉載,若此文章存在違規(guī)行為，您可以聯(lián)系管理員刪除。

轉載請注明本文地址：http://systransis.cn/yun/64906.html

[LeetCode] 297. Serialize and Deserialize Binary T

Problem Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection li...

MRZYD 2019-08-19 11:13 評論0 收藏0
leetcode297. Serialize and Deserialize Binary Tree

摘要：因此題目中的例子的中序遍歷結果為。但是，標準的中序遍歷并不能使我們將該結果反構造成一棵樹，我們丟失了父節(jié)點和子節(jié)點之間的關系。這里我們也可以明顯的看出來，中序遍歷需要保存的空值遠遠多于廣度優(yōu)先遍歷。題目要求 Serialization is the process of converting a data structure or object into a sequence of ...

desdik 2019-08-15 14:30 評論0 收藏0
LeetCode 297. Serialize and Deserialize Binary Tre

摘要：題目大意將二叉樹序列化，返回序列化的，和反序列化還原。解題思路技巧在于將記錄為便于將來判斷。的思想將每一層記錄下來，反序列化時也按照層級遍歷的方法依次設置為上一個里面的元素的左孩子和右孩子。變種，可以要求輸出一個，而不是 LeetCode 297. Serialize and Deserialize Binary Tree 題目大意: 將二叉樹序列化，返回序列化的String，和反序列...

cc17 2019-08-16 13:28 評論0 收藏0
Serialize and Deserialize Binary Tree & BST

摘要：思路理論上說所有遍歷的方法都可以。但是為了使和的過程都盡量最簡單，是不錯的選擇。用作為分隔符，來表示。復雜度代碼思路這道題和之前不同，一般的樹變成了，而且要求是。還是可以用，還是需要分隔符，但是就不需要保存了。 297. Serialize and Deserialize Binary Tree Serialization is the process of converting a...

eccozhou 2019-08-14 17:11 評論0 收藏0
[LintCode/LeetCode] Binary Tree Serialization

摘要：這里要注意的是的用法。所以記住，用可以從自動分離出數(shù)組。跳過第一個元素并放入數(shù)組最快捷語句建立的用意記錄處理過的結點并按處理所有結點和自己的連接下面先通過判斷，再修改的符號的順序，十分巧妙更輕便的解法 Problem Design an algorithm and write code to serialize and deserialize a binary tree. Writin...

keithyau 2019-08-14 15:12 評論0 收藏0