标签:null class 实现 eof int buffer app return code
题目描述:请实现两个函数,分别用来序列化和反序列化二叉树
思路:遍历
public class Solution { int index=-1; String Serialize(TreeNode root) { StringBuffer sb=new StringBuffer(); if(root==null){ sb.append("#,"); return sb.toString(); } sb.append(root.val+","); sb.append(Serialize(root.left)); sb.append(Serialize(root.right)); return sb.toString(); } TreeNode Deserialize(String str) { index++; if(index>=str.length()) return null; String[] strr=str.split(","); TreeNode node=null; if(!strr[index].equals("#")){ node=new TreeNode(Integer.valueOf(strr[index])); node.left=Deserialize(str); node.right=Deserialize(str); } return node; } }
标签:null class 实现 eof int buffer app return code
原文地址:https://www.cnblogs.com/Aaron12/p/9535251.html