{"id":675,"date":"2020-06-22T02:34:14","date_gmt":"2020-06-21T18:34:14","guid":{"rendered":"http:\/\/www.guanhaobo.cn\/?p=675"},"modified":"2020-06-22T02:34:14","modified_gmt":"2020-06-21T18:34:14","slug":"jz4-%e9%87%8d%e5%bb%ba%e4%ba%8c%e5%8f%89%e6%a0%91","status":"publish","type":"post","link":"https:\/\/www.guanhaobo.cn\/?p=675","title":{"rendered":"JZ4 \u2014 \u91cd\u5efa\u4e8c\u53c9\u6811"},"content":{"rendered":"

\u9898\u76ee\u63cf\u8ff0<\/h3>\n

\u8f93\u5165\u67d0\u4e8c\u53c9\u6811\u7684\u524d\u5e8f\u904d\u5386\u548c\u4e2d\u5e8f\u904d\u5386\u7684\u7ed3\u679c\uff0c\u8bf7\u91cd\u5efa\u51fa\u8be5\u4e8c\u53c9\u6811\u3002\u5047\u8bbe\u8f93\u5165\u7684\u524d\u5e8f\u904d\u5386\u548c\u4e2d\u5e8f\u904d\u5386\u7684\u7ed3\u679c\u4e2d\u90fd\u4e0d\u542b\u91cd\u590d\u7684\u6570\u5b57\u3002\u4f8b\u5982\u8f93\u5165\u524d\u5e8f\u904d\u5386\u5e8f\u5217{1,2,4,7,3,5,6,8}\u548c\u4e2d\u5e8f\u904d\u5386\u5e8f\u5217{4,7,2,1,5,3,8,6}\uff0c\u5219\u91cd\u5efa\u4e8c\u53c9\u6811\u5e76\u8fd4\u56de\u3002<\/p>\n

\u9898\u76ee\u5206\u6790<\/h3>\n

\u524d\u5e8f\u904d\u5386\uff1a\u4e2d\u3001\u5de6\u3001\u53f3\uff0c\u524d\u5e8f\u904d\u5386\u7684\u7b2c\u4e00\u4e2a\u5143\u7d20\u5c31\u662f\u4e8c\u53c9\u6811\u7684\u6839\u7ed3\u70b9\u3002
\n\u4e2d\u5e8f\u904d\u5386\uff1a\u5de6\u3001\u4e2d\u3001\u53f3\uff0c\u6839\u7ed3\u70b9\u7684\u5de6\u5b50\u6811\u90fd\u5728\u5e8f\u5217\u7684\u5de6\u8fb9\uff0c\u53f3\u5b50\u6811\u90fd\u5728\u5e8f\u5217\u7684\u53f3\u8fb9\u3002<\/p>\n

\u57fa\u672c\u601d\u8def\uff1a
\n1. \u5728\u4e2d\u5e8f\u904d\u5386\u5e8f\u5217\u4e2d\u627e\u5230\u6839\u7ed3\u70b9\u7684\u4f4d\u7f6e\u3002
\n2. \u4e2d\u5e8f\u904d\u5386\u5e8f\u5217vin<\/code>\u4e2d\uff0c\u6839\u7ed3\u70b9\u5de6\u8fb9\u7684\u90fd\u5728\u5de6\u5b50\u6811\u4e0a\uff0c\u53f3\u8fb9\u7684\u90fd\u5728\u53f3\u5b50\u6811\u4e0a\u3002\u7531\u6b64\u53ef\u4ee5\u5f97\u5230left_vin<\/code>\u548cright_vin<\/code>\u3002
\n3. \u904d\u5386\u524d\u5e8f\u904d\u5386\u5e8f\u5217pre<\/code>\uff0c\u5982\u679c\u5143\u7d20\u5728left_vin<\/code>\u4e2d\uff0c\u8bf4\u660e\u5728\u5de6\u5b50\u6811\u4e0a\uff0c\u5c06\u5176\u6dfb\u52a0\u5230left_pre<\/code>\uff1b\u53cd\u4e4b\u5219\u5c06\u5176\u6dfb\u52a0\u5230right_pre<\/code>\u4e2d\u3002
\n4. \u73b0\u5728\u5df2\u7ecf\u5206\u522b\u5f97\u5230\u5de6\u53f3\u5b50\u6811\u7684\u524d\u5e8f\u904d\u5386\u548c\u4e2d\u5e8f\u904d\u5386\u5e8f\u5217\u4e86\uff0c\u9012\u5f52\u8c03\u7528\u6b64\u8fc7\u7a0b\u5373\u53ef\u3002\u8ba9\u5f53\u524d\u7ed3\u70b9\u7684\u5de6\u5b69\u5b50\u6307\u5411\u5de6\u5b50\u6811\u7684reConstructBinaryTree<\/code>\u7684\u7ed3\u679c\uff0c\u53f3\u5b69\u5b50\u6307\u5411\u53f3\u5b50\u6811\u7684reConstructBinaryTree<\/code>\u7684\u7ed3\u679c\u3002<\/p>\n

C++<\/h3>\n
\/**\n * Definition for binary tree\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\n{\npublic:\n    TreeNode *reConstructBinaryTree(vector<int> pre, vector<int> vin)\n    {\n        TreeNode *res = new TreeNode(pre[0]);\n        vector<int> left_pre, left_vin, right_pre, right_vin;\n        \/\/\u627e\u5230\u6839\u7ed3\u70b9\u5728\u4e2d\u5e8f\u904d\u5386\u4e2d\u7684\u4f4d\u7f6e\n        int root = find(vin.begin(), vin.end(), pre[0]) - vin.begin();\n        \/\/\u627e\u51fa\u5de6\u5b50\u6811\n        for (int i = 0; i < root; i++)\n            left_vin.push_back(vin[i]);\n        \/\/\u627e\u51fa\u53f3\u5b50\u6811\n        for (int i = root + 1; i < vin.size(); i++)\n            right_vin.push_back(vin[i]);\n        for (int i = 1; i < pre.size(); i++)\n        {\n            \/\/\u5728\u5de6\u5b50\u6811\u4e2d\n            if (find(left_vin.begin(), left_vin.end(), pre[i]) != left_vin.end())\n                left_pre.push_back(pre[i]);\n            else\n                right_pre.push_back(pre[i]);\n        }\n        \/\/\u9012\u5f52\n        if (left_vin.size() > 0)\n            res->left = reConstructBinaryTree(left_pre, left_vin);\n        if (right_vin.size() > 0)\n            res->right = reConstructBinaryTree(right_pre, right_vin);\n        return res;\n    }\n};\n<\/code><\/pre>\n
Java<\/h3>\n
\/**\n * Definition for binary tree\n * public class TreeNode {\n *     int val;\n *     TreeNode left;\n *     TreeNode right;\n *     TreeNode(int x) { val = x; }\n * }\n *\/\nimport java.util.*;\nimport java.util.stream.Collectors;\n\npublic class Solution {\n    public TreeNode reConstructBinaryTree(int[] pre2, int[] vin2) {\n        List<Integer> pre = Arrays.stream(pre2).boxed().collect(Collectors.toList());\n        List<Integer> vin = Arrays.stream(vin2).boxed().collect(Collectors.toList());\n        List<Integer> left_pre = new ArrayList<>(), left_vin, right_pre = new ArrayList<>(), right_vin;\n        TreeNode res = new TreeNode(pre2[0]);\n        \/\/ \u627e\u5230\u6839\u7ed3\u70b9\u5728\u4e2d\u5e8f\u904d\u5386\u4e2d\u7684\u4f4d\u7f6e\n        int root = vin.indexOf(pre2[0]);\n        \/\/ \u627e\u51fa\u5de6\u5b50\u6811\n        left_vin = vin.subList(0, root);\n        \/\/ \u627e\u51fa\u53f3\u5b50\u6811\n        right_vin = vin.subList(root + 1, vin.size());\n        for (int x : pre.subList(1, pre.size())) {\n            \/\/ \u5728\u5de6\u5b50\u6811\u4e2d\n            if (left_vin.indexOf(x) != -1)\n                left_pre.add(x);\n            else\n                right_pre.add(x);\n        }\n        \/\/ \u9012\u5f52\n        if (left_vin.size() > 0)\n            res.left = reConstructBinaryTree(left_pre.stream().mapToInt(Integer::valueOf).toArray(),\n                    left_vin.stream().mapToInt(Integer::valueOf).toArray());\n        if (right_vin.size() > 0)\n            res.right = reConstructBinaryTree(right_pre.stream().mapToInt(Integer::valueOf).toArray(),\n                    right_vin.stream().mapToInt(Integer::valueOf).toArray());\n        return res;\n    }\n}\n<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
\u9898\u76ee\u63cf\u8ff0 \u8f93\u5165\u67d0\u4e8c\u53c9\u6811\u7684\u524d\u5e8f\u904d\u5386\u548c\u4e2d\u5e8f\u904d\u5386\u7684\u7ed3\u679c\uff0c\u8bf7\u91cd\u5efa\u51fa\u8be5\u4e8c\u53c9\u6811\u3002\u5047\u8bbe\u8f93\u5165\u7684\u524d\u5e8f\u904d\u5386\u548c\u4e2d\u5e8f\u904d\u5386\u7684\u7ed3\u679c\u4e2d\u90fd\u4e0d\u542b […]<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5],"tags":[39],"class_list":["post-675","post","type-post","status-publish","format-standard","hentry","category-algo","tag-offer"],"_links":{"self":[{"href":"https:\/\/www.guanhaobo.cn\/index.php?rest_route=\/wp\/v2\/posts\/675","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.guanhaobo.cn\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.guanhaobo.cn\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.guanhaobo.cn\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.guanhaobo.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=675"}],"version-history":[{"count":0,"href":"https:\/\/www.guanhaobo.cn\/index.php?rest_route=\/wp\/v2\/posts\/675\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.guanhaobo.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=675"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.guanhaobo.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=675"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.guanhaobo.cn\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=675"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}