1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-02 22:13:28 +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> 搜索 </strong>树的根节点该树的节点值各不相同请你将其转换为累加树Greater Sum Tree使每个节点 <code>node</code>&nbsp;的新值等于原树中大于或等于&nbsp;<code>node.val</code>&nbsp;的值之和。</p>\n\n<p>提醒一下,二叉搜索树满足下列约束条件:</p>\n\n<ul>\n\t<li>节点的左子树仅包含键<strong> 小于 </strong>节点键的节点。</li>\n\t<li>节点的右子树仅包含键<strong> 大于</strong> 节点键的节点。</li>\n\t<li>左右子树也必须是二叉搜索树。</li>\n</ul>\n\n<p><strong>注意:</strong>本题和 1038:&nbsp;<a href=\"https://leetcode-cn.com/problems/binary-search-tree-to-greater-sum-tree/\">https://leetcode-cn.com/problems/binary-search-tree-to-greater-sum-tree/</a> 相同</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/05/03/tree.png\" style=\"height: 364px; width: 534px;\"></strong></p>\n\n<pre><strong>输入:</strong>[4,1,6,0,2,5,7,null,null,null,3,null,null,null,8]\n<strong>输出:</strong>[30,36,21,36,35,26,15,null,null,null,33,null,null,null,8]\n</pre>\n\n<p><strong>示例 2</strong></p>\n\n<pre><strong>输入:</strong>root = [0,null,1]\n<strong>输出:</strong>[1,null,1]\n</pre>\n\n<p><strong>示例 3</strong></p>\n\n<pre><strong>输入:</strong>root = [1,0,2]\n<strong>输出:</strong>[3,3,2]\n</pre>\n\n<p><strong>示例 4</strong></p>\n\n<pre><strong>输入:</strong>root = [3,2,4,1]\n<strong>输出:</strong>[7,9,4,10]\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li>树中的节点数介于 <code>0</code>&nbsp;和 <code>10<sup>4</sup></code><sup>&nbsp;</sup>之间。</li>\n\t<li>每个节点的值介于 <code>-10<sup>4</sup></code>&nbsp;和&nbsp;<code>10<sup>4</sup></code>&nbsp;之间。</li>\n\t<li>树中的所有值 <strong>互不相同</strong> 。</li>\n\t<li>给定的树为二叉搜索树。</li>\n</ul>\n",
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 684,
"likes": 706,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"143.3K\", \"totalSubmission\": \"196.9K\", \"totalAcceptedRaw\": 143333, \"totalSubmissionRaw\": 196902, \"acRate\": \"72.8%\"}",
"stats": "{\"totalAccepted\": \"151.1K\", \"totalSubmission\": \"206.3K\", \"totalAcceptedRaw\": 151144, \"totalSubmissionRaw\": 206346, \"acRate\": \"73.2%\"}",
"hints": [],
"solution": null,
"status": null,