[LeetCode][105] Construct Binary Tree from Preorder and Inorder Traversal

以下是爆栈写法 当前测试过不掉了（以前貌似可以 看到discus里有好多和我一样的写法
原因就是传递函数的过程中复制消耗了栈空间 同时时间也不乐观的大量提升

所以告诉我们一个道理。能用辅助函数就用辅助函数来操作上下界，直接写太ugly 维护性差 而且内存会爆炸。

---

/*
 * @lc app=leetcode id=105 lang=cpp
 *
 * [105] Construct Binary Tree from Preorder and Inorder Traversal
 *
 * https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/description/
 *
 * algorithms
 * Medium (39.07%)
 * Total Accepted:    196K
 * Total Submissions: 501.8K
 * Testcase Example:  '[3,9,20,15,7]\n[9,3,15,20,7]'
 *
 * Given preorder and inorder traversal of a tree, construct the binary tree.
 *
 * Note:
 * You may assume that duplicates do not exist in the tree.
 *
 * For example, given
 *
 *
 * preorder = [3,9,20,15,7]
 * inorder = [9,3,15,20,7]
 *
 * Return the following binary tree:
 *
 *
 * ⁠   3
 * ⁠  / \
 * ⁠ 9  20
 * ⁠   /  \
 * ⁠  15   7
 *
 */
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
 public:
  TreeNode* buildTree(vector<int> preorder, vector<int> inorder) {
    //根据前中序获取一个二叉树
    //        k       j i
    //      pre 中左右  in 左中右
    //     preorder = [3,9,20,15,7]
    //     inorder  = [9,3,15,20,7]
    if (preorder.empty() || inorder.empty()) {
      return static_cast<TreeNode*>(nullptr);
    }
    TreeNode* root = new TreeNode(preorder[0]);
    for (size_t i = 0; i < inorder.size(); i++) {
      if (inorder[i] == root->val) {
        //左子树为空
        if (i == 0) {
          root->left = nullptr;

          root->right =
              buildTree(vector<int>(preorder.begin() + 1, preorder.end()),
                        vector<int>(inorder.begin() + 1, inorder.end()));
          break;
        } else if (i == inorder.size() - 1) {  //右子树空
          root->right = nullptr;
          root->left =
              buildTree(vector<int>(preorder.begin() + 1, preorder.end()),
                        vector<int>(inorder.begin(), inorder.end() - 1));
          break;
        } else {
          int j = i - 1;  //左边区间最右的一个是右是相同的 in

          // k是左子树最右的元素 pre
          for (size_t k = 0; k < preorder.size(); k++) {
            if (inorder[j] == preorder[k]) {
              root->left = buildTree(
                  vector<int>(preorder.begin() + 1, preorder.begin() + k + 1),
                  vector<int>(inorder.begin(), inorder.begin() + j + 1));

              root->right = buildTree(
                  vector<int>(preorder.begin() + k + 1, preorder.end()),
                  vector<int>(inorder.begin() + i + 1, inorder.end()));
              return root;
            }
          }
        }
      }
    }
    return root;
  }

 
};

---

AC解法

  TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
    return builTreeHelper(preorder, 0, preorder.size(), inorder, 0,
                          inorder.size());
  }

  TreeNode* builTreeHelper(vector<int>& preorder, int sp, int ep,
                           vector<int>& inorder, int si, int ei) {
    if (sp == ep) return nullptr;
    TreeNode* root = new TreeNode(preorder[sp]);
    int dis = find(inorder.begin() + si, inorder.begin() + ei, preorder[sp]) -
              inorder.begin() - si;
    root->left =
        builTreeHelper(preorder, sp + 1, sp + 1 + dis, inorder, si, si + dis);
    root->right =
        builTreeHelper(preorder, sp + 1 + dis, ep, inorder, si + dis + 1, ei);
    return root;
  }