LeetCode 331. Verify Preorder Serialization of a Binary Tree

Verify Preorder Serialization of a Binary Tree

Medium
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:

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

Input: “1,#”
Output: false
Example 3:

Input: “9,#,#,1”
Output: false

思路

recuCheck递归检查子树是否合法。isValidSerialization不从recuCheck(ss)直接返回而要另外加入ptr == ss.length是因为防止非法字符串的某个前缀是合法的，从而被误认为是整个字符串是合法的。

代码

/*
 * @lc app=leetcode id=331 lang=java
 *
 * [331] Verify Preorder Serialization of a Binary Tree
 */
class Solution {
    private int ptr = 0;

    private boolean recuCheck(String[] ss) {
        // System.out.println(ptr);
        if (ss.length == ptr) {
            ++ptr;
            return false;
        }
        if (ss[ptr++].equals("#")) {
            // System.out.println("#");
            return true;
        }
        if (recuCheck(ss)) {
            return recuCheck(ss);
        } else {
            return false;
        }
    }

    public boolean isValidSerialization(String preorder) {
        String[] ss = preorder.split(",");
        if (ss.length == 0) {
            return false;
        }
        recuCheck(ss);
        return ptr == ss.length;
    }
}