{"id":2182,"date":"2016-09-10T15:45:14","date_gmt":"2016-09-10T07:45:14","guid":{"rendered":"http:\/\/boweihe.me\/?p=2182"},"modified":"2016-09-10T15:45:14","modified_gmt":"2016-09-10T07:45:14","slug":"leetcode-105-construct-binary-tree-from-preorder-and-inorder-traversal","status":"publish","type":"post","link":"https:\/\/dayandcarrot.space\/?p=2182","title":{"rendered":"LeetCode 105. Construct Binary Tree from Preorder and Inorder Traversal"},"content":{"rendered":"<h3>\u601d\u8def<\/h3>\n<p>title\u771f\u662f\u957f..\u7ed9\u524d\u5e8f\u904d\u5386\u548c\u4e2d\u5e8f\u904d\u5386\uff0c\u6784\u9020\u4e8c\u53c9\u6811\u3002<br \/>\n\u524d\u5e8f\u904d\u5386\u5c31\u662fNode, Left, Right\uff0c\u800c\u4e2d\u5e8f\u904d\u5386\u662fLeft, Node, Right\uff0c\u56e0\u6b64\u7ed9\u4e00\u4e2a\u524d\u5e8f\u904d\u5386\u7684\u5e8f\u5217\uff0c\u4ed6\u7684\u7b2c\u4e00\u4e2a\u8282\u70b9\u80af\u5b9a\u5c31\u662f\u90a3\u4e2aNode\uff0c\u7136\u540e\u5728\u4e2d\u5e8f\u5e8f\u5217\u91cc\u627e\uff0c\u5c31\u80fd\u628a\u5e8f\u5217\u5206\u6210\u5de6\u4e2d\u53f3\u4e09\u90e8\u5206\u3002<br \/>\n\u81ea\u7136\u5730\u5c31\u8981\u7528\u9012\u5f52\u5566~<\/p>\n<h3>\u4ee3\u7801<\/h3>\n<pre class=\"tab-convert:true lang:c++ decode:true \">\/**\n * Definition for a binary tree node.\n * struct TreeNode {\n *     int val;\n *     TreeNode *left;\n *     TreeNode *right;\n *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}\n * };\n *\/\nclass Solution {\npublic:\n    TreeNode* buildTreeSub(const vector&lt;int&gt;&amp; preorder, int p_start, int p_end,\n                            const vector&lt;int&gt;&amp; inorder, int i_start, int i_end){\n        int pivot = preorder[p_start];\n        TreeNode* root = new TreeNode(pivot);\n        int indexPivotInorder = -1;\n        for(indexPivotInorder=i_start; indexPivotInorder&lt;=i_end; indexPivotInorder++){\n            if(inorder[indexPivotInorder] == pivot)\n                break;\n        }\n        int len_left = indexPivotInorder-i_start;\n        if(indexPivotInorder &gt; i_start){\n            \/\/if we still have left part\n            root-&gt;left = buildTreeSub(preorder, p_start+1, p_start+len_left, inorder, i_start, indexPivotInorder-1);\n        }\n        if(indexPivotInorder &lt; i_end){\n            \/\/if we still have right part\n            root-&gt;right = buildTreeSub(preorder, p_start+len_left+1, p_end, inorder, indexPivotInorder+1, i_end);\n        }\n        return root;\n    }\n    TreeNode* buildTree(vector&lt;int&gt;&amp; preorder, vector&lt;int&gt;&amp; inorder) {\n        if(preorder.empty() || inorder.empty())\n            return NULL;\n        return buildTreeSub(preorder, 0, preorder.size()-1, inorder, 0, inorder.size()-1);\n    }\n};<\/pre>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>\u601d\u8def title\u771f\u662f\u957f..\u7ed9\u524d\u5e8f\u904d\u5386\u548c\u4e2d\u5e8f\u904d\u5386\uff0c\u6784\u9020\u4e8c\u53c9\u6811\u3002 \u524d\u5e8f\u904d\u5386\u5c31\u662fNode, Left, Right\uff0c\u800c\u4e2d\u5e8f\u904d\u5386\u662fLeft, Node, Right\uff0c\u56e0\u6b64\u7ed9\u4e00\u4e2a\u524d\u5e8f\u904d\u5386\u7684\u5e8f\u5217\uff0c\u4ed6\u7684\u7b2c\u4e00\u4e2a\u8282\u70b9\u80af\u5b9a\u5c31\u662f\u90a3\u4e2aNode\uff0c\u7136\u540e\u5728\u4e2d\u5e8f\u5e8f\u5217\u91cc\u627e\uff0c\u5c31\u80fd\u628a\u5e8f\u5217\u5206\u6210\u5de6\u4e2d\u53f3\u4e09\u90e8\u5206\u3002 \u81ea\u7136\u5730\u5c31\u8981\u7528\u9012\u5f52\u5566~ \u4ee3\u7801 \/** * 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: TreeNode* buildTreeSub(const vector&lt;int&gt;&amp; preorder, int p_start, int p_end, const vector&lt;int&gt;&amp; [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[4],"tags":[66,133],"class_list":["post-2182","post","type-post","status-publish","format-standard","hentry","category-study","tag-leetcode-oj","tag-133"],"_links":{"self":[{"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=\/wp\/v2\/posts\/2182","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=2182"}],"version-history":[{"count":0,"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=\/wp\/v2\/posts\/2182\/revisions"}],"wp:attachment":[{"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=2182"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=2182"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=2182"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}