C++ | Leetcode C++题解之第331题验证二叉树的前序序列化
题目：
题解：
class Solution {
public:bool isValidSerialization(string preorder) {int n = preorder.length();int i = 0;int slots = 1;while (i < n) {if (slots == 0) {return false;}if (preorder[i] == ',') {i++;} else if (preorder[i] == '#'){slots--;i++;} else {// 读一个数字while (i < n && preorder[i] != ',') {i++;}slots++; // slots = slots - 1 + 2}}return slots == 0;}
};