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
类似于先序遍历的步骤,将整数放入栈中,遇到#时将栈顶的数取出。如果是一个二叉树的话,最后栈为空。
public class Solution {
public boolean isValidSerialization(String preorder) {
String[] s=preorder.split(",");
if(s.length==1&&!s[0].equals("#")) return false;
int l=s.length-1;
Stack<Integer> stack=new Stack<>();
for(int i=0;i<l;i++){
if(!s[i].equals("#")){
stack.add(1);
}
else{
if(stack.isEmpty()) return false;
stack.pop();
}
}
return stack.isEmpty();
}
}
优化:栈其实是不必要的,只需要一个计数的int就可以了。
public class Solution {
public boolean isValidSerialization(String preorder) {
String[] s=preorder.split(",");
if(s.length==1&&!s[0].equals("#")) return false;
int l=s.length-1,count=0;
for(int i=0;i<l;i++){
if(!s[i].equals("#")){
count++;
}
else{
if(count==0) return false;
count--;
}
}
return count==0;
}
}