Leetcode | Verify Preorder Serialization of a Binary Tree

question:

One way to serialize a binary tree is to use pre-order traversal. When we encounter a non-null node, we record the node’s value. If it is a null node, we record using a sentinel value such as #.

 _9_
/   \
3     2
/ \   / \
4   1  #  6
/ \ / \   / \

For example, the above binary tree can be serialized to the string “9,3,4,#,#,1,#,#,2,#,6,#,#”, where # represents a null node.

Given a string of comma separated values, verify whether it is a correct preorder traversal serialization of a binary tree. Find an algorithm without reconstructing the tree.

Each comma separated value in the string must be either an integer or a character ‘#’ representing null pointer.

You may assume that the input format is always valid, for example it could never contain two consecutive commas such as “1,,3”.

Example 1:
“9,3,4,#,#,1,#,#,2,#,6,#,#”
Return true

Example 2:
“1,#”
Return false

Example 3:
“9,#,#,1”
Return false

normal solution:

/*思路 将数字入栈 也将"#"入栈 当字符为"#"时 判断栈顶是否为'#' 表明该先序遍历的左边已经遍历完毕 出栈'#'和数字
*  然后不进行下一步的循环 就是上次遍历的结果为一个"#" 继续做当前的循环 接着循环遍历
*
* */
public boolean isValidSerialization(String preorder)
{


    Stack<String> stack=new Stack<String>();
    int len=preorder.length();
    if(len==0)
    {
        return false;
    }
    if(preorder.charAt(0)=='#')
    {
        return false;
    }

    String []strs=preorder.substring(1,len-1).split(",");
    String tmp=null;
    len=strs.length;
    int i=0;
    while(i<len)
    {
        System.out.println("str i "+strs[i]+" "+i);
        if(!strs[i].equals("#"))
        {
            stack.push(strs[i]);
            System.out.println("push "+strs[i]);
        }else
        {
            if(!stack.empty() && stack.peek().equals("#") )
            {
                System.out.println("pop  "+stack.peek());
                stack.pop();
                if(!stack.empty() && !stack.peek().equals("#"))
                {
                    System.out.println("pop  "+stack.peek());
                    stack.pop();
                    continue;

                }

                return false;
            }else
            {
                stack.push("#");
                System.out.println("push # ");
            }
        }
        i++;
    }

    if(!stack.empty())
    {
        tmp=stack.pop();
        if(stack.empty() && tmp=="#")
        {
            return true;
        }
    }

    return false;

}

excellent solution

每个非空的父节点都有两个子节点 空的父节（题意中用“#”表示）点没有子节点，用diff表示还需要走的节点数，当遍历到每一个节点都减一
当该节点不是空的父节点 则增2

public boolean isValidSerialization(String preorder) {

    String[] nodes = preorder.split(",");
    int diff = 1;
    for (String node: nodes) {
        if (--diff < 0) return false;
        if (!node.equals("#")) diff += 2;


    }
    return diff == 0;
}