Add solution 0538、1038

2025-07-06 09:23:19 +08:00 · 2021-02-11 03:53:43 +08:00
parent 3bd8dd1732
commit 3c1ad916e7
32 changed files with 1328 additions and 661 deletions
--- a/leetcode/0538.Convert-BST-to-Greater-Tree/538.
+++ b/leetcode/0538.Convert-BST-to-Greater-Tree/538.
@ -0,0 +1,36 @@
+package leetcode
+
+import (
+	"github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ *     Val int
+ *     Left *TreeNode
+ *     Right *TreeNode
+ * }
+ */
+
+func convertBST(root *TreeNode) *TreeNode {
+	if root == nil {
+		return root
+	}
+	sum := 0
+	dfs538(root, &sum)
+	return root
+}
+
+func dfs538(root *TreeNode, sum *int) {
+	if root == nil {
+		return
+	}
+	dfs538(root.Right, sum)
+	root.Val += *sum
+	*sum = root.Val
+	dfs538(root.Left, sum)
+}
--- a/leetcode/0538.Convert-BST-to-Greater-Tree/538.
+++ b/leetcode/0538.Convert-BST-to-Greater-Tree/538.
@ -0,0 +1,76 @@
+package leetcode
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/halfrost/LeetCode-Go/structures"
+)
+
+type question538 struct {
+	para538
+	ans538
+}
+
+// para 是参数
+// one 代表第一个参数
+type para538 struct {
+	one []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans538 struct {
+	one []int
+}
+
+func Test_Problem538(t *testing.T) {
+
+	qs := []question538{
+
+		{
+			para538{[]int{3, 1, structures.NULL, 0, structures.NULL, -4, structures.NULL, structures.NULL, -2}},
+			ans538{[]int{3, 4, structures.NULL, 4, structures.NULL, -2, structures.NULL, structures.NULL, 2}},
+		},
+
+		{
+			para538{[]int{2, 1}},
+			ans538{[]int{2, 3}},
+		},
+
+		{
+			para538{[]int{}},
+			ans538{[]int{}},
+		},
+
+		{
+			para538{[]int{4, 1, 6, 0, 2, 5, 7, structures.NULL, structures.NULL, structures.NULL, 3, structures.NULL, structures.NULL, structures.NULL, 8}},
+			ans538{[]int{30, 36, 21, 36, 35, 26, 15, structures.NULL, structures.NULL, structures.NULL, 33, structures.NULL, structures.NULL, structures.NULL, 8}},
+		},
+
+		{
+			para538{[]int{0, structures.NULL, 1}},
+			ans538{[]int{1, structures.NULL, 1}},
+		},
+
+		{
+			para538{[]int{1, 0, 2}},
+			ans538{[]int{3, 3, 2}},
+		},
+
+		{
+			para538{[]int{3, 2, 4, 1}},
+			ans538{[]int{7, 9, 4, 10}},
+		},
+	}
+
+	fmt.Printf("------------------------Leetcode Problem 538------------------------\n")
+
+	for _, q := range qs {
+		_, p := q.ans538, q.para538
+		fmt.Printf("【input】:%v      ", p)
+		root := structures.Ints2TreeNode(p.one)
+		fmt.Printf("【output】:%v      \n", structures.Tree2ints(convertBST(root)))
+	}
+	fmt.Printf("\n\n\n")
+}
--- a/leetcode/0538.Convert-BST-to-Greater-Tree/README.md
+++ b/leetcode/0538.Convert-BST-to-Greater-Tree/README.md
@ -0,0 +1,106 @@
+# [538. Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree/)
+
+## 题目
+
+Given the `root` of a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all keys greater than the original key in BST.
+
+As a reminder, a *binary search tree* is a tree that satisfies these constraints:
+
+- The left subtree of a node contains only nodes with keys **less than** the node's key.
+- The right subtree of a node contains only nodes with keys **greater than** the node's key.
+- Both the left and right subtrees must also be binary search trees.
+
+**Note:** This question is the same as 1038: [https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/)
+
+**Example 1:**
+
+![https://assets.leetcode.com/uploads/2019/05/02/tree.png](https://assets.leetcode.com/uploads/2019/05/02/tree.png)
+
+```
+Input: root = [4,1,6,0,2,5,7,null,null,null,3,null,null,null,8]
+Output: [30,36,21,36,35,26,15,null,null,null,33,null,null,null,8]
+```
+
+**Example 2:**
+
+```
+Input: root = [0,null,1]
+Output: [1,null,1]
+```
+
+**Example 3:**
+
+```
+Input: root = [1,0,2]
+Output: [3,3,2]
+```
+
+**Example 4:**
+
+```
+Input: root = [3,2,4,1]
+Output: [7,9,4,10]
+```
+
+**Constraints:**
+
+- The number of nodes in the tree is in the range `[0, 104]`.
+- `104 <= Node.val <= 104`
+- All the values in the tree are **unique**.
+- `root` is guaranteed to be a valid binary search tree.
+
+## 题目大意
+
+给出二叉 搜索 树的根节点，该树的节点值各不相同，请你将其转换为累加树（Greater Sum Tree），使每个节点 node 的新值等于原树中大于或等于 node.val 的值之和。
+
+提醒一下，二叉搜索树满足下列约束条件：
+
+- 节点的左子树仅包含键 小于 节点键的节点。
+- 节点的右子树仅包含键 大于 节点键的节点。
+- 左右子树也必须是二叉搜索树。
+
+## 解题思路
+
+- 根据二叉搜索树的有序性，想要将其转换为累加树，只需按照 右节点 - 根节点 - 左节点的顺序遍历，并累加和即可。
+- 此题同第 1038 题。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+	"github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ *     Val int
+ *     Left *TreeNode
+ *     Right *TreeNode
+ * }
+ */
+
+func convertBST(root *TreeNode) *TreeNode {
+	if root == nil {
+		return root
+	}
+	sum := 0
+	dfs538(root, &sum)
+	return root
+}
+
+func dfs538(root *TreeNode, sum *int) {
+	if root == nil {
+		return
+	}
+	dfs538(root.Right, sum)
+	root.Val += *sum
+	*sum = root.Val
+	dfs538(root.Left, sum)
+}
+```
--- a/leetcode/1038.Binary-Search-Tree-to-Greater-Sum-Tree/1038.
+++ b/leetcode/1038.Binary-Search-Tree-to-Greater-Sum-Tree/1038.
@ -0,0 +1,36 @@
+package leetcode
+
+import (
+	"github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ *     Val int
+ *     Left *TreeNode
+ *     Right *TreeNode
+ * }
+ */
+
+func bstToGst(root *TreeNode) *TreeNode {
+	if root == nil {
+		return root
+	}
+	sum := 0
+	dfs1038(root, &sum)
+	return root
+}
+
+func dfs1038(root *TreeNode, sum *int) {
+	if root == nil {
+		return
+	}
+	dfs1038(root.Right, sum)
+	root.Val += *sum
+	*sum = root.Val
+	dfs1038(root.Left, sum)
+}
--- a/leetcode/1038.Binary-Search-Tree-to-Greater-Sum-Tree/1038.
+++ b/leetcode/1038.Binary-Search-Tree-to-Greater-Sum-Tree/1038.
@ -0,0 +1,76 @@
+package leetcode
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/halfrost/LeetCode-Go/structures"
+)
+
+type question1038 struct {
+	para1038
+	ans1038
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1038 struct {
+	one []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1038 struct {
+	one []int
+}
+
+func Test_Problem1038(t *testing.T) {
+
+	qs := []question1038{
+
+		{
+			para1038{[]int{3, 1, structures.NULL, 0, structures.NULL, -4, structures.NULL, structures.NULL, -2}},
+			ans1038{[]int{3, 4, structures.NULL, 4, structures.NULL, -2, structures.NULL, structures.NULL, 2}},
+		},
+
+		{
+			para1038{[]int{2, 1}},
+			ans1038{[]int{2, 3}},
+		},
+
+		{
+			para1038{[]int{}},
+			ans1038{[]int{}},
+		},
+
+		{
+			para1038{[]int{4, 1, 6, 0, 2, 5, 7, structures.NULL, structures.NULL, structures.NULL, 3, structures.NULL, structures.NULL, structures.NULL, 8}},
+			ans1038{[]int{30, 36, 21, 36, 35, 26, 15, structures.NULL, structures.NULL, structures.NULL, 33, structures.NULL, structures.NULL, structures.NULL, 8}},
+		},
+
+		{
+			para1038{[]int{0, structures.NULL, 1}},
+			ans1038{[]int{1, structures.NULL, 1}},
+		},
+
+		{
+			para1038{[]int{1, 0, 2}},
+			ans1038{[]int{3, 3, 2}},
+		},
+
+		{
+			para1038{[]int{3, 2, 4, 1}},
+			ans1038{[]int{7, 9, 4, 10}},
+		},
+	}
+
+	fmt.Printf("------------------------Leetcode Problem 1038------------------------\n")
+
+	for _, q := range qs {
+		_, p := q.ans1038, q.para1038
+		fmt.Printf("【input】:%v      ", p)
+		root := structures.Ints2TreeNode(p.one)
+		fmt.Printf("【output】:%v      \n", structures.Tree2ints(bstToGst(root)))
+	}
+	fmt.Printf("\n\n\n")
+}
--- a/leetcode/1038.Binary-Search-Tree-to-Greater-Sum-Tree/README.md
+++ b/leetcode/1038.Binary-Search-Tree-to-Greater-Sum-Tree/README.md
@ -0,0 +1,107 @@
+# [1038. Binary Search Tree to Greater Sum Tree](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/)
+
+
+## 题目
+
+Given the `root` of a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all keys greater than the original key in BST.
+
+As a reminder, a *binary search tree* is a tree that satisfies these constraints:
+
+- The left subtree of a node contains only nodes with keys **less than** the node's key.
+- The right subtree of a node contains only nodes with keys **greater than** the node's key.
+- Both the left and right subtrees must also be binary search trees.
+
+**Note:** This question is the same as 538: [https://leetcode.com/problems/convert-bst-to-greater-tree/](https://leetcode.com/problems/convert-bst-to-greater-tree/)
+
+**Example 1:**
+
+![https://assets.leetcode.com/uploads/2019/05/02/tree.png](https://assets.leetcode.com/uploads/2019/05/02/tree.png)
+
+```
+Input: root = [4,1,6,0,2,5,7,null,null,null,3,null,null,null,8]
+Output: [30,36,21,36,35,26,15,null,null,null,33,null,null,null,8]
+```
+
+**Example 2:**
+
+```
+Input: root = [0,null,1]
+Output: [1,null,1]
+```
+
+**Example 3:**
+
+```
+Input: root = [1,0,2]
+Output: [3,3,2]
+```
+
+**Example 4:**
+
+```
+Input: root = [3,2,4,1]
+Output: [7,9,4,10]
+```
+
+**Constraints:**
+
+- The number of nodes in the tree is in the range `[1, 100]`.
+- `0 <= Node.val <= 100`
+- All the values in the tree are **unique**.
+- `root` is guaranteed to be a valid binary search tree.
+
+## 题目大意
+
+给出二叉 搜索 树的根节点，该树的节点值各不相同，请你将其转换为累加树（Greater Sum Tree），使每个节点 node 的新值等于原树中大于或等于 node.val 的值之和。
+
+提醒一下，二叉搜索树满足下列约束条件：
+
+- 节点的左子树仅包含键 小于 节点键的节点。
+- 节点的右子树仅包含键 大于 节点键的节点。
+- 左右子树也必须是二叉搜索树。
+
+## 解题思路
+
+- 根据二叉搜索树的有序性，想要将其转换为累加树，只需按照 右节点 - 根节点 - 左节点的顺序遍历，并累加和即可。
+- 此题同第 538 题。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+	"github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ *     Val int
+ *     Left *TreeNode
+ *     Right *TreeNode
+ * }
+ */
+
+func bstToGst(root *TreeNode) *TreeNode {
+	if root == nil {
+		return root
+	}
+	sum := 0
+	dfs1038(root, &sum)
+	return root
+}
+
+func dfs1038(root *TreeNode, sum *int) {
+	if root == nil {
+		return
+	}
+	dfs1038(root.Right, sum)
+	root.Val += *sum
+	*sum = root.Val
+	dfs1038(root.Left, sum)
+}
+```