1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
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

View File

@@ -12,7 +12,7 @@
"translatedContent": "<p>给定一个二叉搜索树的根节点 <strong>root </strong>和一个值 <strong>key</strong>,删除二叉搜索树中的&nbsp;<strong>key&nbsp;</strong>对应的节点,并保证二叉搜索树的性质不变。返回二叉搜索树(有可能被更新)的根节点的引用。</p>\n\n<p>一般来说,删除节点可分为两个步骤:</p>\n\n<ol>\n\t<li>首先找到需要删除的节点;</li>\n\t<li>如果找到了,删除它。</li>\n</ol>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1:</strong></p>\n\n<p><img src=\"https://assets.leetcode.com/uploads/2020/09/04/del_node_1.jpg\" style=\"width: 800px;\" /></p>\n\n<pre>\n<strong>输入:</strong>root = [5,3,6,2,4,null,7], key = 3\n<strong>输出:</strong>[5,4,6,2,null,null,7]\n<strong>解释:</strong>给定需要删除的节点值是 3所以我们首先找到 3 这个节点,然后删除它。\n一个正确的答案是 [5,4,6,2,null,null,7], 如下图所示。\n另一个正确答案是 [5,2,6,null,4,null,7]。\n\n<img src=\"https://assets.leetcode.com/uploads/2020/09/04/del_node_supp.jpg\" style=\"width: 350px;\" />\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre>\n<strong>输入:</strong> root = [5,3,6,2,4,null,7], key = 0\n<strong>输出:</strong> [5,3,6,2,4,null,7]\n<strong>解释:</strong> 二叉树不包含值为 0 的节点\n</pre>\n\n<p><strong>示例 3:</strong></p>\n\n<pre>\n<strong>输入:</strong> root = [], key = 0\n<strong>输出:</strong> []</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li>节点数的范围&nbsp;<code>[0, 10<sup>4</sup>]</code>.</li>\n\t<li><code>-10<sup>5</sup>&nbsp;&lt;= Node.val &lt;= 10<sup>5</sup></code></li>\n\t<li>节点值唯一</li>\n\t<li><code>root</code>&nbsp;是合法的二叉搜索树</li>\n\t<li><code>-10<sup>5</sup>&nbsp;&lt;= key &lt;= 10<sup>5</sup></code></li>\n</ul>\n\n<p>&nbsp;</p>\n\n<p><strong>进阶:</strong> 要求算法时间复杂度为&nbsp;O(h)h 为树的高度。</p>\n",
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 689,
"likes": 724,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Split BST\", \"titleSlug\": \"split-bst\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u62c6\\u5206\\u4e8c\\u53c9\\u641c\\u7d22\\u6811\"}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"96.2K\", \"totalSubmission\": \"191.3K\", \"totalAcceptedRaw\": 96159, \"totalSubmissionRaw\": 191271, \"acRate\": \"50.3%\"}",
"stats": "{\"totalAccepted\": \"104K\", \"totalSubmission\": \"205.9K\", \"totalAcceptedRaw\": 103982, \"totalSubmissionRaw\": 205945, \"acRate\": \"50.5%\"}",
"hints": [],
"solution": null,
"status": null,