zoukankan      html  css  js  c++  java
  • 428. Serialize and Deserialize Nary Tree 序列化、反序列化n叉树

    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 an N-ary tree. An N-ary tree is a rooted tree in which each node has no more than N children. There is no restriction on how your serialization/deserialization algorithm should work. You just need to ensure that an N-ary 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 3-ary tree

     

    as [1 [3[5 6] 2 4]]. Note that this is just an example, you do not necessarily need to follow this format.

    Or you can follow LeetCode's level order traversal serialization format, where each group of children is separated by the null value.

     

    For example, the above tree may be serialized as [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14].

    You do not necessarily need to follow the above-suggested formats, there are many more different formats that work so please be creative and come up with different approaches yourself.

     

    Example 1:

    Input: root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]
    Output: [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]
    

    Example 2:

    Input: root = [1,null,3,2,4,null,5,6]
    Output: [1,null,3,2,4,null,5,6]
    

    Example 3:

    Input: root = []
    Output: []

    class Codec {
    
        // Encodes a tree to a single string.
        public String serialize(Node root) {
            List<String> list=new LinkedList<>();
            serializeHelper(root,list);
            return String.join(",",list);
        }
        
        private void serializeHelper(Node root, List<String> list){
            if(root==null){
                return;
            }else{
                list.add(String.valueOf(root.val));
                list.add(String.valueOf(root.children.size()));
                for(Node child:root.children){
                    serializeHelper(child,list);
                }
            }
        }
    
        // Decodes your encoded data to tree.
        public Node deserialize(String data) {
            if(data.isEmpty())
                return null;
            
            String[] ss=data.split(",");
            Queue<String> q=new LinkedList<>(Arrays.asList(ss));
            return deserializeHelper(q);
        }
        
        private Node deserializeHelper(Queue<String> q){
            Node root=new Node();
            root.val=Integer.parseInt(q.poll());
            int size=Integer.parseInt(q.poll());
            root.children=new ArrayList<Node>(size);
            for(int i=0;i<size;i++){
                root.children.add(deserializeHelper(q));
            }
            return root;
        }
    }
    
    
    
     
  • 相关阅读:
    计算机基础知识
    第三次作业函数
    c博客作业01顺序、分支结构
    C语言第02次作业循环结构
    c语言第0次作业
    JAVA在Eclipse里能运行,但是在cmd中却提示找不到主函数的错误【环境变量配置】
    MFC自定义消息机制步骤
    关于VC6.0界面MFC设置成XP风格问题【可以变得更加好看】
    VC6 下学习使用Teechart8记录 一 安装和熟悉teechart8【一个非常好的画图插件】
    Matlab中,让程序自动处理类似A1,A2,A3变量的方法。
  • 原文地址:https://www.cnblogs.com/immiao0319/p/15640886.html
Copyright © 2011-2022 走看看