序列化是将一个数据结构或者对象转换为连续的比特位的操作,进而可以将转换后的数据存储在一个文件或者内存中,同时也可以通过网络传输到另一个计算机环境,采取相反方式重构得到原数据。
/**
* 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> q = new LinkedList<>();
StringBuilder s = new StringBuilder("[");
q.add(root);
while(!q.isEmpty()){
TreeNode t = q.poll();
if(t!=null){
q.add(t.left);
q.add(t.right);
s.append(t.val+",");
}
else s.append("null,");
}
s.deleteCharAt(s.length()-1);//用于反序列化
s.append("]");
return s.toString();//StringBuilder不是返回类型
}
// Decodes your encoded data to tree.
public TreeNode deserialize(String data) {
if(data.equals("[ ]") ) return null;
Queue<TreeNode> q = new LinkedList<>();
String[] v = data.substring(1, data.length()-1).split(",");//去掉首尾中括号,并用逗号隔开
TreeNode root = new TreeNode(Integer.parseInt(v[0]));//Integer.parseInt()把()里的内容转换成整数
q.add(root);
int i=1;
while(!q.isEmpty()){
TreeNode t = q.poll();
if(!v[i].equals("null")){
t.left = new TreeNode(Integer.parseInt(v[i]));//需要新建节点
q.add(t.left);
}
i++;
if(!v[i].equals("null")){
t.right = new TreeNode(Integer.parseInt(v[i]));
q.add(t.right);
}
i++;
}
return root;
}
}
// Your Codec object will be instantiated and called as such:
// Codec codec = new Codec();
// codec.deserialize(codec.serialize(root));