LeetCode 331. Verify Preorder Serialization of a Binary Tree（校验二叉树的前序遍历序列化）

原题网址：https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree/

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

方法一：广度优先搜索，对于每个非空节点，下一层的理论节点数增加2个，对于空节点，下一层的理论节点数增加0个。则按照此方法逐层检查，直到结束。如果结束时没有检查完所有节点，或者不够节点，则校验失败，否则成功。

public class Solution {
    public boolean isValidSerialization(String preorder) {
        if (preorder == null) return false;
        String[] tree = preorder.split(",");
        int from = 0, to = 1;
        int next = to;
        while (from < tree.length) {
            for(int i=from; i<to; i++) {
                if (!"#".equals(tree[i])) next += 2;
            }
            if (next > tree.length) return false;
            if (next == to && next < tree.length) return false;
            from = to;
            to = next;
        }
        return true;
    }
}

优化：

public class Solution {
    public boolean isValidSerialization(String preorder) {
        String[] nodes = preorder.split(",");
        int to = 1;
        for(int i=0; i<nodes.length; i++) {
            if (i>=to) return false;
            if (!"#".equals(nodes[i])) to += 2;
        }
        return to == nodes.length;
    }
}

方法二：使用栈。

public class Solution {
    public boolean isValidSerialization(String preorder) {
        String[] nodes = preorder.split(",");
        int size = 0;
        for(int i=0; i<nodes.length; i++) {
            nodes[size++] = nodes[i];
            while (size >= 3 && "#".equals(nodes[size-1]) && "#".equals(nodes[size-2]) && !"#".equals(nodes[size-3])) {
                nodes[size-3] = "#";
                size -= 2;
            }
        }
        return size == 1 && "#".equals(nodes[0]);
    }
}