105. Construct Binary Tree from Preorder and Inorder Traversal
来源:互联网 发布:java web 跨域访问 编辑:程序博客网 时间:2024/05/22 15:10
105. Construct Binary Tree from Preorder and Inorder Traversal
思路:
recursion
code:
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: vector<int>::iterator getIndex(vector<int>::iterator inB, vector<int>::iterator inE, int target) { vector<int>::iterator index = inB; for (index; index != inE; index++) if (*index == target) break; return index; } TreeNode* preIn(vector<int>::iterator preB, vector<int>::iterator preE, vector<int>::iterator inB, vector<int>::iterator inE) { if (preE == preB) { return NULL; } else { TreeNode* root = new TreeNode(*preB); vector<int>::iterator inI = getIndex(inB, inE, *preB); root->left = preIn(preB+1, preB+(inI-inB+1), inB, inI); root->right = preIn(preB+(inI-inB+1), preE, inI+1, inE); return root; } } TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) { return preIn(preorder.begin(), preorder.end(), inorder.begin(), inorder.end()); }};
阅读全文
0 0
- LeetCode 105. 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]*105.Construct Binary Tree from Preorder and Inorder Traversal
- [leetcode] 105.Construct Binary Tree from Preorder and Inorder Traversal
- 105. Construct Binary Tree from Preorder and Inorder Traversal
- 105. Construct Binary Tree from Preorder and Inorder Traversal
- 105. Construct Binary Tree from Preorder and Inorder Traversal
- 105. Construct Binary Tree from Preorder and Inorder Traversal
- 105. Construct Binary Tree from Preorder and Inorder Traversal
- 105. Construct Binary Tree from Preorder and Inorder Traversal
- Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal
- 105. 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
- 105. Construct Binary Tree from Preorder and Inorder Traversal
- Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal
- 105. Construct Binary Tree from Preorder and Inorder Traversal
- Android常见异常记录
- Windows7集成SP1微软原版光盘镜像下载汇总
- 仿 iOS 列表的编辑功能
- 处理recycleview与viewpage的滑动冲突
- 7. Cordova文件操作和IO
- 105. Construct Binary Tree from Preorder and Inorder Traversal
- PhpStrom8.0.3配置Yaf
- Java 定时任务
- Larange插值
- 106. Construct Binary Tree from Inorder and Postorder Traversal
- 什么是N+1查询?
- React Js 微信禁止复制链接,分享,禁止隐藏右上角菜单
- java多态性
- 将二叉搜索树转换成链表