coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-02 14:12:17 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode-cn/originData/construct-binary-tree-from-inorder-and-postorder-traversal.json
View File

@@ -12,7 +12,7 @@
"translatedContent": "<p>给定两个整数数组 <code>inorder</code> 和 <code>postorder</code> ，其中 <code>inorder</code> 是二叉树的中序遍历， <code>postorder</code> 是同一棵树的后序遍历，请你构造并返回这颗&nbsp;<em>二叉树</em>&nbsp;。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/02/19/tree.jpg\" />\n<pre>\n<b>输入：</b>inorder = [9,3,15,20,7], postorder = [9,15,7,20,3]\n<b>输出：</b>[3,9,20,null,null,15,7]\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre>\n<b>输入：</b>inorder = [-1], postorder = [-1]\n<b>输出：</b>[-1]\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 &lt;= inorder.length &lt;= 3000</code></li>\n\t<li><code>postorder.length == inorder.length</code></li>\n\t<li><code>-3000 &lt;= inorder[i], postorder[i] &lt;= 3000</code></li>\n\t<li><code>inorder</code>&nbsp;和&nbsp;<code>postorder</code>&nbsp;都由 <strong>不同</strong> 的值组成</li>\n\t<li><code>postorder</code>&nbsp;中每一个值都在&nbsp;<code>inorder</code>&nbsp;中</li>\n\t<li><code>inorder</code>&nbsp;<strong>保证</strong>是树的中序遍历</li>\n\t<li><code>postorder</code>&nbsp;<strong>保证</strong>是树的后序遍历</li>\n</ul>\n",
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 705,
"likes": 727,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Construct Binary Tree from Preorder and Inorder Traversal\", \"titleSlug\": \"construct-binary-tree-from-preorder-and-inorder-traversal\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u4ece\\u524d\\u5e8f\\u4e0e\\u4e2d\\u5e8f\\u904d\\u5386\\u5e8f\\u5217\\u6784\\u9020\\u4e8c\\u53c9\\u6811\"}]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"177.1K\", \"totalSubmission\": \"244.9K\", \"totalAcceptedRaw\": 177141, \"totalSubmissionRaw\": 244939, \"acRate\": \"72.3%\"}",
"stats": "{\"totalAccepted\": \"187.1K\", \"totalSubmission\": \"258.5K\", \"totalAcceptedRaw\": 187050, \"totalSubmissionRaw\": 258504, \"acRate\": \"72.4%\"}",
"hints": [],
"solution": null,
"status": null,