面试题7：重建二叉树

对vector使用指针

#include <stdio.h>
#include <iostream>
#include <vector>
using namespace std;
 
int main()
{
	vector<int> a,b,c;
 
	for (int i = 0; i < 3; i++)
	{
		a.push_back( i );
		b.push_back( i  + 3);
		c.push_back(i + 6);
	}
	vector<int>* seq[3] = {&a,&b,&c};
	vector<int>* curr = 0;
	for (int j = 0; j < 3; j++)
	{
		curr = seq[j];
		printf("%d\n", curr->at(0) );
		printf("%d\n", curr->at(1));
		printf("%d\n", curr->at(2) );
	}
	getchar();}

 

二叉树结构体定义

 

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

 

题目描述

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

 

刷第一遍

 

/**
 * Definition for binary tree
 * 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 lenth = pre.size();
        /