Python | Leetcode Python题解之第331题验证二叉树的前序序列化
题目：
题解：
class Solution:def isValidSerialization(self, preorder: str) -> bool:p = preorder.split(",")n = len(p)cn = c3 = 0for i, x in enumerate(p):if x == "#": c3 += 1else: cn += 1if c3 > cn:return i+1 == n #if end is truereturn False