07_ConstructBinaryTree(重建二叉树）

题目描述

输入某二叉树的前序遍历和中序遍历的结果，请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6}，则重建二叉树并返回。

解题思路：

前序遍历的第一个值为根节点的值，使用这个值将中序遍历结果分成两部分，左部分为树的左子树中序遍历结果，右部分为树的右子树中序遍历的结果。然后以该方式去考虑子树的状况

class Solution {
public:
	TreeNode * reConstructBinaryTree(vector<int> pre, vector<int> vin) {
		if (pre.empty() || vin.empty())
			return nullptr;
		vector<int> pre_left, pre_right, in_left, in_right;
		TreeNode* root = new TreeNode(pre[0]);
		int rootpz;
		for (int i = 0; i < vin.size(); ++i)
		{
			if (vin[i] == pre[0])
			{
				rootpz = i;
				break;
			}
		}
		for (int i = 0; i < rootpz; ++i)
		{
			in_left.push_back(vin[i]);
			pre_left.push_back(pre[i + 1]);

		}
		for (int i = rootpz+1; i < pre.size(); ++i)
		{
			in_right.push_back(vin[i]);
			pre_right.push_back(pre[i]);
		}
        //注意上面这个地方先将i赋值rootpz+1后进行循环，不能像下面这样
		//for (int i = rootpz; i < pre.size(); ++i)
		//{
		//	in_right.push_back(vin[i+1]);
		//	pre_right.push_back(pre[i+1]);
		//}
 
		root->left = reConstructBinaryTree(pre_left, in_left);
		root->right= reConstructBinaryTree(pre_right, in_right);
		return root;
	}
};

解法二：将上面的改进一下，不用每次递归都构造容器，传递引用和索引

class Solution {
 public:
	 TreeNode * reConstructBinaryTree(vector<int> pre, vector<int> vin)
	 {
		 int n = pre.size();
		 if (n == 0)
		 return nullptr;
		 else
			 return reConstructTree(pre, vin, 0, n - 1, 0, n - 1);
	 }

	 TreeNode* reConstructTree(vector<int>& pre, vector<int>& vin, int pre_left, int pre_right, int in_left, int in_right)
	 {
		 TreeNode* root = new TreeNode(pre[pre_left]);
		 if (pre_left == pre_right)
			 return root;

		 int rootpz;
		 for (int i = in_left; i <= in_right; ++i)
		 {
			 if (vin[i] == pre[pre_left])
			 {
				 rootpz = i;
				 break;
			 }
		 }
		 int left_len = rootpz - in_left;
		 int right_len = in_right-rootpz;
		 if(left_len>0)
		 root->left = reConstructTree(pre, vin, pre_left + 1, pre_left+left_len, in_left, rootpz - 1);
		 if(right_len>0)
		 root->right = reConstructTree(pre, vin, pre_left + left_len+1, pre_right, rootpz + 1, in_right);
		 return root;

	 }

 };