coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-25 14:58:56 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode-cn/originData/recover-a-tree-from-preorder-traversal.json
View File

@@ -12,7 +12,7 @@
"translatedContent": "<p>我们从二叉树的根节点 <code>root</code>&nbsp;开始进行深度优先搜索。</p>\n\n<p>在遍历中的每个节点处，我们输出&nbsp;<code>D</code>&nbsp;条短划线（其中&nbsp;<code>D</code>&nbsp;是该节点的深度），然后输出该节点的值。（<em>如果节点的深度为 <code>D</code>，则其直接子节点的深度为 <code>D + 1</code>。根节点的深度为 <code>0</code>）。</em></p>\n\n<p>如果节点只有一个子节点，那么保证该子节点为左子节点。</p>\n\n<p>给出遍历输出&nbsp;<code>S</code>，还原树并返回其根节点&nbsp;<code>root</code>。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1：</strong></p>\n\n<p><strong><img alt=\"\" src=\"https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/04/12/recover-a-tree-from-preorder-traversal.png\" style=\"height: 200px; width: 320px;\"></strong></p>\n\n<pre><strong>输入：</strong>&quot;1-2--3--4-5--6--7&quot;\n<strong>输出：</strong>[1,2,5,3,4,6,7]\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<p><strong><img alt=\"\" src=\"https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/04/12/screen-shot-2019-04-10-at-114101-pm.png\" style=\"height: 250px; width: 256px;\"></strong></p>\n\n<pre><strong>输入：</strong>&quot;1-2--3---4-5--6---7&quot;\n<strong>输出：</strong>[1,2,5,3,null,6,null,4,null,7]\n</pre>\n\n<p><strong>示例 3：</strong></p>\n\n<p><img alt=\"\" src=\"https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/04/12/screen-shot-2019-04-10-at-114955-pm.png\" style=\"height: 250px; width: 276px;\"></p>\n\n<pre><strong>输入：</strong>&quot;1-401--349---90--88&quot;\n<strong>输出：</strong>[1,401,null,349,88,90]\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li>原始树中的节点数介于 <code>1</code> 和 <code>1000</code> 之间。</li>\n\t<li>每个节点的值介于 <code>1</code> 和 <code>10 ^ 9</code> 之间。</li>\n</ul>\n",
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 206,
"likes": 207,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"22K\", \"totalSubmission\": \"30K\", \"totalAcceptedRaw\": 21956, \"totalSubmissionRaw\": 30016, \"acRate\": \"73.1%\"}",
"stats": "{\"totalAccepted\": \"22K\", \"totalSubmission\": \"30.1K\", \"totalAcceptedRaw\": 21982, \"totalSubmissionRaw\": 30051, \"acRate\": \"73.1%\"}",
"hints": [
"Do an iterative depth first search, parsing dashes from the string to inform you how to link the nodes together."
],