剑指offer-重建二叉树
根据二叉树的前序和中序遍历,重建二叉树
class Test{
int [] preorder;
HashMap<Integer,Integer> map = new HashMap<>();
public TreeNode buildTree(int [] preorder,int [] inorder){
this.preorder = preorder;
for(int i =0;i<inorder.length;i++){
map.put(ino
原创
2021-02-24 21:29:50 ·
84 阅读 ·
0 评论