【編程題】序列化和反序列化二叉樹（Java實現）

標題

題目來源

劍指offer第61題
https://www.nowcoder.com/practice/cf7e25aa97c04cc1a68c8f040e71fb84?tpId=13&tqId=11214&tPage=4&rp=4&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking

題目描述

https://www.nowcoder.com/practice/cf7e25aa97c04cc1a68c8f040e71fb84?tpId=13&tqId=11214&tPage=4&rp=4&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking

題目代碼

/*
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;

    }

}
*/
public class Solution {
    StringBuilder ss=new StringBuilder();
    String Serialize(TreeNode root) {
        if(root==null){
            ss.append("#,");
            return ss.toString();
        }
        ss.append(root.val+",");
        Serialize(root.left);
        Serialize(root.right);
        return ss.toString();
  }
     int index=-1;
    TreeNode Deserialize(String str) {
       if(str.equals("")||str.length()==0||str==null)
           return null;
          String[] str1=str.split(",");
        return Deserialize(str1);
  }
    TreeNode Deserialize(String[] str) {
        index++;
        if(!str[index].equals("#")){
            TreeNode root=new TreeNode(0);
            root.val=Integer.valueOf(str[index]);
            root.left=Deserialize(str);
            root.right=Deserialize(str);
            return root;
        }
        return null;
    }
}