{"id":103106,"date":"2020-05-21T05:27:37","date_gmt":"2020-05-20T21:27:37","guid":{"rendered":"http:\/\/4563.org\/?p=103106"},"modified":"2020-05-21T05:27:37","modified_gmt":"2020-05-20T21:27:37","slug":"leetcode-lintcode-%e9%a2%98%e8%a7%a3-%e5%89%8d%e5%ba%8f%e9%81%8d%e5%8e%86%e5%92%8c%e4%b8%ad%e5%ba%8f%e9%81%8d%e5%8e%86%e6%a0%91%e6%9e%84%e9%80%a0%e4%ba%8c%e5%8f%89%e6%a0%91","status":"publish","type":"post","link":"http:\/\/4563.org\/?p=103106","title":{"rendered":"[leetcode\/lintcode \u9898\u89e3] \u524d\u5e8f\u904d\u5386\u548c\u4e2d\u5e8f\u904d\u5386\u6811\u6784\u9020\u4e8c\u53c9\u6811"},"content":{"rendered":"<div>\n<div>\n<div>\n<h1>                  [leetcode\/lintcode \u9898\u89e3] \u524d\u5e8f\u904d\u5386\u548c\u4e2d\u5e8f\u904d\u5386\u6811\u6784\u9020\u4e8c\u53c9\u6811               <\/h1>\n<p> <\/p>\n<div>\n<div> <span>\u8cc7\u6df1\u5927\u4f6c : hakunamatata11 <\/span>  <span><i><\/i> 2<\/span> <\/div>\n<div> <\/div>\n<\/p><\/div>\n<\/p><\/div>\n<\/p><\/div>\n<div isfirst=\"1\"> <\/p>\n<p>[\u9898\u76ee\u63cf\u8ff0] \u6839\u636e\u524d\u5e8f\u904d\u5386\u548c\u4e2d\u5e8f\u904d\u5386\u6811\u6784\u9020\u4e8c\u53c9\u6811.<\/p>\n<p>\u5728\u7ebf\u8bc4\u6d4b\u5730\u5740: https:\/\/www.jiuzhang.com\/solution\/construct-binary-tree-from-preorder-and-inorder-traversal\/?utm_source=sc-csdn-fks0522<\/p>\n<p>[\u6837\u4f8b] \u6837\u4f8b 1:<\/p>\n<pre><code>\u8f93\u5165\uff1a[],[] \u8f93\u51fa\uff1a{} \u89e3\u91ca\uff1a \u4e8c\u53c9\u6811\u4e3a\u7a7a  <\/code><\/pre>\n<p>\u6837\u4f8b 2:<\/p>\n<pre><code>\u8f93\u5165\uff1a[2,1,3],[1,2,3] \u8f93\u51fa\uff1a{2,1,3} \u89e3\u91ca\uff1a \u4e8c\u53c9\u6811\u5982\u4e0b   2  \/  1   3 <\/code><\/pre>\n<p>[\u9898\u89e3]<\/p>\n<p>Given preorder and inorder traversal of a tree, construct the binary tree.<\/p>\n<p>Note: You may assume that duplicates do not exist in the tree.<\/p>\n<p>\u524d\u5e8f\u7684\u7b2c\u4e00\u4e2a\u4e3a\u6839\uff0c\u5728\u4e2d\u5e8f\u4e2d\u627e\u5230\u6839\u7684\u4f4d\u7f6e\u3002 \u4e2d\u5e8f\u4e2d\u6839\u7684\u5de6\u53f3\u4e24\u8fb9\u5373\u4e3a\u5de6\u53f3\u5b50\u6811\u7684\u4e2d\u5e8f\u904d\u5386\u3002\u540c\u65f6\u53ef\u77e5\u5de6\u5b50\u6811\u7684\u5927\u5c0f size-left \u3002 \u524d\u5e8f\u4e2d\u6839\u63a5\u4e0b\u6765\u7684 size-left \u4e2a\u662f\u5de6\u5b50\u6811\u7684\u524d\u5e8f\u904d\u5386\u3002 \u7531\u6b64\u53ef\u4ee5\u9012\u5f52\u5904\u7406\u5de6\u53f3\u5b50\u6811\u3002<\/p>\n<pre><code>public class Solution {     private int findPosition(int[] arr, int start, int end, int key) {         int i;         for (i = start; i &lt;= end; i++) {             if (arr[i] == key) {                 return i;             }         }         return -1;     }      private TreeNode myBuildTree(int[] inorder, int instart, int inend,             int[] preorder, int prestart, int preend) {         if (instart &gt; inend) {             return null;         }          TreeNode root = new TreeNode(preorder[prestart]);         int position = findPosition(inorder, instart, inend, preorder[prestart]);          root.left = myBuildTree(inorder, instart, position - 1,                 preorder, prestart + 1, prestart + position - instart);         root.right = myBuildTree(inorder, position + 1, inend,                 preorder, position - inend + preend + 1, preend);         return root;     }      public TreeNode buildTree(int[] preorder, int[] inorder) {         if (inorder.length != preorder.length) {             return null;         }         return myBuildTree(inorder, 0, inorder.length - 1, preorder, 0, preorder.length - 1);     } } <\/code><\/pre>\n<p>[\u66f4\u591a\u8bed\u8a00\u4ee3\u7801\u53c2\u8003] https:\/\/www.lintcode.com\/problem\/construct-binary-tree-from-preorder-and-inorder-traversal\/?utm_source=sc-csdn-fks0522<\/p>\n<\/p><\/div>\n<div> <b>\u5927\u4f6c\u6709\u8a71\u8aaa<\/b> (<span>0<\/span>)        <\/div>\n<div> <\/div>\n<\/p><\/div>\n<\/p><\/div>\n<ul>\n<li>\n","protected":false},"excerpt":{"rendered":"<p>[leetcode\/lintcod&hellip;<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[],"tags":[],"_links":{"self":[{"href":"http:\/\/4563.org\/index.php?rest_route=\/wp\/v2\/posts\/103106"}],"collection":[{"href":"http:\/\/4563.org\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/4563.org\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/4563.org\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/4563.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=103106"}],"version-history":[{"count":0,"href":"http:\/\/4563.org\/index.php?rest_route=\/wp\/v2\/posts\/103106\/revisions"}],"wp:attachment":[{"href":"http:\/\/4563.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=103106"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/4563.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=103106"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/4563.org\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=103106"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}