(LeetCode 热题 100) 105. 从前序与中序遍历序列构造二叉树 （深度优先搜索dfs、二叉树）

题目：105. 从前序与中序遍历序列构造二叉树

思路：前序遍历的第一个节点值，在中序遍历找到后，左边的就是改节点的左子树部分，右边的就是改节点的右子树部分。
C++版本：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    TreeNode * node;
    //a:前序遍历当前节点下标、b:中序遍历当前下标、c:中序遍历最大下标
    TreeNode * dfs(vector<int>& preorder, vector<int>& inorder,int a,int b,int c){
        //if(b>c) return nullptr;
        for(int i=b;i<=c;i++){
        	//找到当前节点
            if(preorder[a]==inorder[i]){
                TreeNode * tmp = new TreeNode(preorder[a]);
                //标记
                if(a==0) node = tmp;
                //左子树
                tmp->left= dfs(preorder,inorder,a+1,b,i-1);
                //右子树
                tmp->right= dfs(preorder,inorder,a+i-b+1,i+1,c);
                return tmp;
            }
        }
        return nullptr;
    }
    TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
        dfs(preorder,inorder,0,0,inorder.size()-1);
        return node;
    }
};

JAVA版本：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    TreeNode node;
    TreeNode dfs(int[] preorder, int[] inorder,int a,int b,int c){
        for(int i=b;i<=c;i++){
            if(preorder[a]==inorder[i]){
                TreeNode tmp =new TreeNode(preorder[a]);
                if(a==0) node=tmp;
                tmp.left=dfs(preorder,inorder,a+1,b,i-1);
                tmp.right=dfs(preorder,inorder,a+i-b+1,i+1,c);
                return tmp;
            }
        }
        return null;
    }
    public TreeNode buildTree(int[] preorder, int[] inorder) {
        dfs(preorder,inorder,0,0,inorder.length-1);
        return node;
    }
}