牛客网-《剑指offer》-重建二叉树
题目:http://www.nowcoder.com/practice/8a19cbe657394eeaac2f6ea9b0f6fcf6
C++
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Solution { public: struct TreeNode* reConstructBinaryTree(vector<int> pre,vector<int> in) { if (pre.size() == 0) { return NULL; } TreeNode *root = new TreeNode(pre[0]); vector<int> l_in, r_in, l_pre, r_pre; bool flag = true; for (int i = 0; i < pre.size(); i++) { if (in[i] == pre[0]) { flag = false; continue; } if (flag == true) { l_pre.push_back(pre[i+1]); l_in.push_back(in[i]); } else { r_pre.push_back(pre[i]); r_in.push_back(in[i]);; } } root->left = reConstructBinaryTree(l_pre, l_in); root->right = reConstructBinaryTree(r_pre, r_in); return root; } };
找我内推: 字节跳动各种岗位
作者:
ZH奶酪(张贺)
邮箱:
cheesezh@qq.com
出处:
http://www.cnblogs.com/CheeseZH/
*
本文版权归作者和博客园共有,欢迎转载,但未经作者同意必须保留此段声明,且在文章页面明显位置给出原文连接,否则保留追究法律责任的权利。