# 428. Serialize and Deserialize N-ary Tree
# Hard
# 22910FavoriteShare
# 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]]. You do not necessarily need to follow this format, so please be creative and come up with different approaches yourself.
 
# Note:
# 1.  N is in the range of [1, 1000]
# 2.  Do not use class member/global/static variables to store states. Your serialize and deserialize algorithms should be stateless.
"""
# Definition for a Node.
class Node(object):
    def __init__(self, val, children):
        self.val = val
        self.children = children
"""
class Codec:

    def serialize(self, root):
        """Encodes a tree to a single string.
        
        :type root: Node
        :rtype: str
        """
        if root == None: return "shityourass"
        def dfs(root):
            result = [str(root.val),str(len(root.children))]
            for x in root.children:
                result.extend(dfs(x))
            return result
        return ",".join(dfs(root))
        

    def deserialize(self, data):
        """Decodes your encoded data to tree.
        
        :type data: str
        :rtype: Node
        """
        if data == "shityourass": return None
        data = data.split(",")
        #print(data)
        def dfs(index,data):
            root = Node(int(data[index]),[])
            if data[index+1] == "0": return root, index+2
            temp = []
            new_index = index+2
            for i in range(int(data[index+1])):
                node,new_index = dfs(new_index,data)
                temp.append(node)
            root.children = temp
            return root,new_index
        return dfs(0,data)[0]
    

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