剑指offer第一版 06 利用前序、中序数组构建二叉树

// ConsoleApplication19.cpp: 定义控制台应用程序的入口点。
//

#include "stdafx.h"
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;


 struct TreeNode {
     int val;
     TreeNode *left;
     TreeNode *right;
     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 };

class Solution {
public:
	TreeNode * reConstructBinaryTree(vector<int> pre, vector<int> vin) 
	{
		int preLength = pre.size();
		int vinLength = vin.size();
		if (preLength != vinLength || preLength == 0 || vinLength == 0)
			return NULL;

		return ConstuctTree(pre, vin);
	}

		TreeNode * ConstuctTree(vector<int> prePartition, vector<int> vinPartition)
		{
			int preLengthPartition = prePartition.size();
			int vinLengthPartition = vinPartition.size();
			int rootval = prePartition[0];
			cout << rootval << endl;
			TreeNode *root = new TreeNode (rootval);
			if (preLengthPartition == 1)
			{
				if(vinLengthPartition==1&& prePartition[0]== vinPartition[0])
				return root;
				else
				{
					throw exception("Invalid input!");
				}
			 }
			
			int target = prePartition[0];
			//vector <int>::iterator vinPos = find(vinPartition.begin(),vinPartition.end(), target);
			int totalLength = distance(vinPartition.begin(), vinPartition.end());
			int vinPos = 0;
			while (vinPos <= totalLength - 1 && vinPartition[vinPos] != prePartition[0])
				vinPos++;
			if(vinPos==totalLength&& vinPartition[vinPos-1]!= prePartition[0])
			{
				throw exception("Invalid input!");
			}
			else
			{
				

				if (vinPos > 0)
				{
					vector <int>	 prePartitionLeft(prePartition.begin()+1, prePartition.begin() + vinPos+1);
					cout << "preleft:" << endl;
					for (vector<int>::iterator it = prePartitionLeft.begin(); it != prePartitionLeft.end(); it++)
					{
						cout << *it << "     ";
					}
					cout << endl;
					vector <int>	 vinPartitionLeft(vinPartition.begin(), vinPartition.begin() + vinPos);
					root->left = ConstuctTree(prePartitionLeft, vinPartitionLeft);
				}

				if (vinPos < totalLength-1)
				{
					vector <int>	 prePartitionRight(prePartition.begin() + vinPos+1, prePartition.end());
					vector <int>	 vinPartitionRight(vinPartition.begin() + vinPos+1, vinPartition.end());
					cout <<"vinright:" <<endl;
					for (vector<int>::iterator it = vinPartitionRight.begin(); it !=vinPartitionRight.end(); it++)
					{
						cout << *it << "     ";
					}
					cout << endl;
					root->right = ConstuctTree(prePartitionRight, vinPartitionRight);
				}
				return root;

			}



		}
	
};
int main()
{
	Solution Test;
	vector<int> pre;
	vector<int> vin;
	//pre.push_back(1); pre.push_back(2); pre.push_back(4); pre.push_back(7); pre.push_back(3); pre.push_back(5); pre.push_back(6); pre.push_back(8);
	//vin.push_back(4); vin.push_back(7); vin.push_back(2); vin.push_back(1); vin.push_back(5); vin.push_back(3); vin.push_back(8); vin.push_back(6);
	//pre.push_back(1); pre.push_back(2); pre.push_back(3); pre.push_back(4); pre.push_back(5); pre.push_back(6); pre.push_back(7); 
	//vin.push_back(3); vin.push_back(2); vin.push_back(4); vin.push_back(1); vin.push_back(6); vin.push_back(5); vin.push_back(7); 
	pre.push_back(1); pre.push_back(3); pre.push_back(5); pre.push_back(2); pre.push_back(6); pre.push_back(4); pre.push_back(8); 
	vin.push_back(5); vin.push_back(3); vin.push_back(1); vin.push_back(6); vin.push_back(2); vin.push_back(4); vin.push_back(8); 
	TreeNode * result;
	result = Test.reConstructBinaryTree(pre, vin);
	std::cin.clear();
	std::cin.sync();
	std::cin.get();
	std::cin.get();
	return 0;
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值