算法学习之剑指offer(c++)03--重建二叉树

输入某二叉树的前序遍历和中序遍历的结果，请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6}，则重建二叉树并返回。
代码思路:前序遍历的第一个元素是树的根节点,中序遍历中根节点的左边是树的左子树,右边是右子树,根据中序遍历中左右子树的长度又可以判断出前序遍历中的左右子树,将左右子树视为新树,前序遍历中左子树的元素排序方式就是新树的前序遍历,右子树同理,采用递归的办法,逐步完成,当存放中序遍历的数组为空的时候就可以退出递归

#include <iostream>
#include <vector>

using namespace std;

typedef struct treenode
{
	struct treenode *left;
	struct treenode *right;
	int data;
	treenode(int x) :data(x),left(NULL), right(NULL) {}
}mytree;

class solution
{
public:
	static mytree * tree_init(int data)
	{
		mytree *root = new mytree(data);
		return root;
	}
	static mytree * restruct(vector<int> pre, vector<int> vin)//前序:根左右
	{
		int len = vin.size();
		if (len == 0)
			return NULL;
		vector<int> left_pre, right_pre, left_vin, right_vin;
		mytree* root = new mytree(pre[0]);
		int gen = 0;
		for (int i = 0; i < len; i++)
		{
			if (vin[i] == pre[0])
			{
				gen = i;
				break;
			}
		}
		for (int i = 0; i < gen; i++)
		{
			left_pre.push_back(pre[i + 1]);
			left_vin.push_back(vin[i]);
		}
		for (int i = gen + 1; i < len; i++)
		{
			right_pre.push_back(pre[i]);
			right_vin.push_back(vin[i]);
		}
		root->left = restruct(left_pre, left_vin);
		root->right = restruct(right_pre, right_vin);
		return root;
	}

};



int main()
{
	vector<int> pre = { 1,2,4,7,3,5,6,8 };
	vector<int> vin = { 4,7,2,1,5,3,8,6 };
	solution::restruct(pre, vin);
}