LeetCode之Construct Binary Tree from Preorder and Inorder Traversal
2013-12-12 09:45
411 查看
这个题和由中序和后序构建二叉树基本一样,看看就行了。。。。LeetCode 之 Construct Binary Tree
from Inorder and Postorder Traversal
代码(136ms):
from Inorder and Postorder Traversal
代码(136ms):
class Solution { public: TreeNode *buildTree(vector<int> &preorder, vector<int> &inorder) { return recover(inorder,0, inorder.size()-1, preorder ,0, preorder.size()-1); } TreeNode* recover(vector<int> &inorder, int inStart, int inEnd, vector<int> &preorder ,int preStart, int preEnd){ if(inStart > inEnd) return NULL; int root = preorder[preStart]; int pos = 0;//root前有pos个前序的 for(int i= 0;i<=inEnd-inStart;i++){ if(inorder[inStart+i] == root){ pos = i; break; } } TreeNode * node = new TreeNode(root); node->left = recover(inorder , inStart , inStart+pos-1 , preorder, preStart+1 , preStart+pos); node->right = recover(inorder , inStart+pos+1 , inEnd , preorder, preStart+pos+1 , preEnd); return node; } };
相关文章推荐
- leetcode-java-105. Construct Binary Tree from Preorder and Inorder Traversal
- leetcode之Construct Binary Tree from Preorder and Inorder Traversal
- Construct Binary Tree from Preorder and Inorder Traversal (中序和后序建树,在题目给的函数中完成)【leetcode】
- Construct Binary Tree from Preorder and Inorder Traversal——LeetCode
- 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
- 【leetcode刷题笔记】Construct Binary Tree from Preorder and Inorder Traversal
- [LeetCode]108. 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】C# 105、Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode105: 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]105. Construct Binary Tree from Preorder and Inorder Traversal@python
- leetcode 日经贴,Cpp code -Construct Binary Tree from Preorder and Inorder Traversal