kk
This commit is contained in:
2
.idea/misc.xml
generated
2
.idea/misc.xml
generated
@@ -8,7 +8,7 @@
|
|||||||
</list>
|
</list>
|
||||||
</option>
|
</option>
|
||||||
</component>
|
</component>
|
||||||
<component name="ProjectRootManager" version="2" languageLevel="JDK_17" default="true" project-jdk-name="17" project-jdk-type="JavaSDK">
|
<component name="ProjectRootManager" version="2" languageLevel="JDK_X" default="true" project-jdk-name="21" project-jdk-type="JavaSDK">
|
||||||
<output url="file://$PROJECT_DIR$/out" />
|
<output url="file://$PROJECT_DIR$/out" />
|
||||||
</component>
|
</component>
|
||||||
</project>
|
</project>
|
4
src/main/java/com/dota/common/Tree.java
Normal file
4
src/main/java/com/dota/common/Tree.java
Normal file
@@ -0,0 +1,4 @@
|
|||||||
|
package com.dota.common;
|
||||||
|
|
||||||
|
public class Tree {
|
||||||
|
}
|
20
src/main/java/com/dota/common/TreeNode.java
Normal file
20
src/main/java/com/dota/common/TreeNode.java
Normal file
@@ -0,0 +1,20 @@
|
|||||||
|
package com.dota.common;
|
||||||
|
|
||||||
|
public class TreeNode {
|
||||||
|
public int val;
|
||||||
|
public TreeNode left;
|
||||||
|
public TreeNode right;
|
||||||
|
|
||||||
|
TreeNode() {
|
||||||
|
}
|
||||||
|
|
||||||
|
TreeNode(int val) {
|
||||||
|
this.val = val;
|
||||||
|
}
|
||||||
|
|
||||||
|
TreeNode(int val, TreeNode left, TreeNode right) {
|
||||||
|
this.val = val;
|
||||||
|
this.left = left;
|
||||||
|
this.right = right;
|
||||||
|
}
|
||||||
|
}
|
24
src/main/java/com/dota/tree/Solution.java
Normal file
24
src/main/java/com/dota/tree/Solution.java
Normal file
@@ -0,0 +1,24 @@
|
|||||||
|
package com.dota.tree;
|
||||||
|
|
||||||
|
import com.dota.common.TreeNode;
|
||||||
|
|
||||||
|
// 1038. 从二叉搜索树到更大和树
|
||||||
|
public class Solution {
|
||||||
|
int sum = 0;
|
||||||
|
|
||||||
|
public TreeNode bstToGst(TreeNode root) {
|
||||||
|
dfs(root);
|
||||||
|
return root;
|
||||||
|
}
|
||||||
|
|
||||||
|
void dfs(TreeNode node) {
|
||||||
|
if (node == null) {
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
dfs(node.right);
|
||||||
|
sum += node.val;
|
||||||
|
node.val = sum;
|
||||||
|
dfs(node.left);
|
||||||
|
}
|
||||||
|
}
|
Reference in New Issue
Block a user