题目描述:
思路:以前做过的一道题。思路很简单,序列化就是二叉树的层序遍历之后输出字符串。反序列化就是将字符串分割后层序创建二叉树。注意细节即可。
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Codec {
// Encodes a tree to a single string.
public String serialize(TreeNode root) {
if(root==null) return"[]";
Queue<TreeNode> queue=new LinkedList();
StringBuilder str=new StringBuilder();
str.append('[');
queue.add(root);
while(!queue.isEmpty()){
TreeNode tem=queue.remove();
if(tem==null) str.append("null,");
else{
queue.add(tem.left);
queue.add(tem.right);
str.append(tem.val+",");
}
}
str.deleteCharAt(str.length()-1);
str.append(']');
return str.toString();
}
// Decodes your encoded data to tree.
public TreeNode deserialize(String data) {
if(data.equals("[]")) return null;
String[] str = data.substring(1, data.length() - 1).split(",");
TreeNode root = new TreeNode(Integer.parseInt(str[0]));
Queue<TreeNode> queue = new LinkedList<>();
queue.add(root);
int i = 1;
while(!queue.isEmpty()) {
TreeNode node = queue.poll();
if(!str[i].equals("null")) {
node.left = new TreeNode(Integer.parseInt(str[i]));
queue.add(node.left);
}
i++;
if(!str[i].equals("null")) {
node.right = new TreeNode(Integer.parseInt(str[i]));
queue.add(node.right);
}
i++;
}
return root;
}
}
// Your Codec object will be instantiated and called as such:
// Codec codec = new Codec();
// codec.deserialize(codec.serialize(root));