出鞘之剑指offer-第37题 (序列化二叉树)

题目：

实现两个函数，序列化和反序列化二叉树。 

分析一：

 

代码一：

package offer.xzs.thirty2thirtynine.thirtyseven;


import java.util.Arrays;

public class Demo01 {

    public static String deserializeStr = null;
    public static void main(String[] args) {
        int[] pre = { 10, 6, 4, 8, 14, 12, 23 };
        int[] mid = { 4, 6, 8, 10, 12, 14, 23 };
        BinaryTree root = build(pre, mid);
        String serriallize = serriallize(root);
        System.out.println(serriallize);

        BinaryTree deserialize = deserialize(serriallize);
        preShow(deserialize);
        System.out.println();
    }

    public static String serriallize(BinaryTree tree) {
        if (tree == null) {
            return "$";
        }
        return tree.getValue() + " " + serriallize(tree.getLeft()) + " " + serriallize(tree.getRight());
    }

    public static BinaryTree deserialize(String str) {
        deserializeStr = str;
        return deserialize();
    }

    private static BinaryTree deserialize() {
        if (deserializeStr.length() == 0) {
            return null;
        }
        int index = deserializeStr.indexOf(" ");
        String node = null;
        if (index == -1) {
            node = deserializeStr;
            deserializeStr = "";
        } else {
            node = deserializeStr.substring(0, index);
            deserializeStr = deserializeStr.substring(index + 1);
        }

        if (node.equals("$")) {
            return null;
        }
        int value = Integer.valueOf(node);
        BinaryTree temp = new BinaryTree(value);
        temp.setLeft(deserialize());
        temp.setRight(deserialize());
        return temp;
    }

    //建二叉树
    public static BinaryTree build(int[] preList, int[] midList) {
        if (preList == null || preList.length == 0 || midList == null || midList.length == 0 || preList.length != midList.length) {
            return null;
        }
        BinaryTree root = new BinaryTree(preList[0]);
        for (int i = 0; i < preList.length; i++) {
            if (preList[0] == midList[i]) {
                root.setLeft(build(Arrays.copyOfRange(preList, 1, i + 1), Arrays.copyOfRange(midList, 0, i)));
                root.setRight(build(Arrays.copyOfRange(preList, i + 1, preList.length), Arrays.copyOfRange(midList, i + 1, midList.length)));
            }
        }
        return root;
    }
    //先序遍历
    public static void preShow(BinaryTree root) {
        if (root == null) {
            return;
        }
        System.out.printf("%d\t", root.getValue());
        if (root.getLeft() != null) {
            preShow(root.getLeft());
        }
        if (root.getRight() != null) {
            preShow(root.getRight());
        }

    }
}