LeetCode Construct Binary Tree from Preorder and Inorder Traversal
2014-01-10 07:42
519 查看
Construct Binary Tree from Preorder and Inorder Traversal
Given preorder and inorder traversal of a tree, construct the binary tree.Note:
You may assume that duplicates do not exist in the tree.
一个小小的下标没搞好,居然要浪费差不多一个小时,心痛啊。
中序遍历序列和后序遍历序列的偏移位置都需要仔细设计好。
class Solution { public: TreeNode *buildTree(vector<int> &preorder, vector<int> &inorder) { return conTree(preorder, inorder, 0, preorder.size()-1, 0, inorder.size()-1); } TreeNode *conTree(vector<int> &preo, vector<int> &ino, int prel, int prer, int inl, int inr) { if (prel > prer) return NULL; TreeNode *t = new TreeNode(preo[prel]); auto it = find(ino.begin()+inl, ino.begin()+inr+1, preo[prel]); int offset = it-ino.begin()-inl; //注意:切记,下标如何定位要清楚,是offset还是绝对位置不能搞混了! t->left = conTree(preo, ino, prel+1, prel+offset, inl, inl+offset-1); t->right = conTree(preo, ino, prel+offset+1, prer, inl+offset+1, inr); return t; } };
相关文章推荐
- [面试真题] LeetCode:Construct Binary Tree from Preorder and Inorder Traversal
- Leetcode Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode---(105)Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode之Construct Binary Tree from Preorder and Inorder Traversal
- leetCode(18):Construct Binary Tree from Preorder and Inorder (Inorder and Postorder) Traversal
- LeetCode——105. Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode_Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode---Construct Binary Tree from Preorder and Inorder Traversal
- 【LeetCode】105. Construct Binary Tree from Preorder and Inorder Traversal 解题报告
- 【LeetCode】Construct Binary Tree from Preorder and Inorder Traversal
- [Leetcode] Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode - 105. Construct Binary Tree from Preorder and Inorder Traversal
- [LeetCode 105] Construct Binary Tree from Preorder and Inorder Traversal
- [leetcode] Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode105—Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode 105. Construct Binary Tree from Preorder and Inorder Traversal
- [leetcode]Construct Binary Tree from Preorder and Inorder Traversal
- leetcode-Construct Binary Tree from Preorder and Inorder Traversal
- 【LeetCode笔记】Construct Binary Tree from Preorder and Inorder Traversal 前序、中序还原二叉树
- [leetcode 105] Construct Binary Tree from Preorder and Inorder Traversal