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-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/er-cha-shu-de-jing-xiang-lcof.json
View File

@@ -12,7 +12,7 @@
"translatedContent": "<p>请完成一个函数，输入一个二叉树，该函数输出它的镜像。</p>\n\n<p>例如输入：</p>\n\n<p><code>&nbsp; &nbsp; &nbsp;4<br>\n&nbsp; &nbsp;/ &nbsp; \\<br>\n&nbsp; 2 &nbsp; &nbsp; 7<br>\n&nbsp;/ \\ &nbsp; / \\<br>\n1 &nbsp; 3 6 &nbsp; 9</code><br>\n镜像输出：</p>\n\n<p><code>&nbsp; &nbsp; &nbsp;4<br>\n&nbsp; &nbsp;/ &nbsp; \\<br>\n&nbsp; 7 &nbsp; &nbsp; 2<br>\n&nbsp;/ \\ &nbsp; / \\<br>\n9 &nbsp; 6 3&nbsp; &nbsp;1</code></p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre><strong>输入：</strong>root = [4,2,7,1,3,6,9]\n<strong>输出：</strong>[4,7,2,9,6,3,1]\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>限制：</strong></p>\n\n<p><code>0 &lt;= 节点个数 &lt;= 1000</code></p>\n\n<p>注意：本题与主站 226 题相同：<a href=\"https://leetcode-cn.com/problems/invert-binary-tree/\">https://leetcode-cn.com/problems/invert-binary-tree/</a></p>\n",
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 239,
"likes": 240,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"253.1K\", \"totalSubmission\": \"319K\", \"totalAcceptedRaw\": 253129, \"totalSubmissionRaw\": 318976, \"acRate\": \"79.4%\"}",
"stats": "{\"totalAccepted\": \"254.1K\", \"totalSubmission\": \"320.2K\", \"totalAcceptedRaw\": 254124, \"totalSubmissionRaw\": 320176, \"acRate\": \"79.4%\"}",
"hints": [],
"solution": null,
"status": null,