Solution to today's problem

spannm · spannm · commit d1828008f5d5 · 2024-06-26T15:51:55.000+02:00
diff --git a/src/main/java/io/github/spannm/leetcode/lc1/lc1300/Problem1382.java b/src/main/java/io/github/spannm/leetcode/lc1/lc1300/Problem1382.java
@@ -13,7 +13,7 @@ TreeNode balanceBST(TreeNode _root) {
         return dfs(inorder, 0, inorder.size() - 1);
     }
 
-    private List<Integer> inorder(TreeNode _root, List<Integer> _list) {
+    static List<Integer> inorder(TreeNode _root, List<Integer> _list) {
         if (_root == null) {
             return _list;
         }
@@ -22,7 +22,7 @@ private List<Integer> inorder(TreeNode _root, List<Integer> _list) {
         return inorder(_root.right, _list);
     }
 
-    private TreeNode dfs(List<Integer> _nums, int _start, int _end) {
+    static TreeNode dfs(List<Integer> _nums, int _start, int _end) {
         if (_end < _start) {
             return null;
         }

Original file line number	Diff line number	Diff line change
`@@ -13,7 +13,7 @@ TreeNode balanceBST(TreeNode _root) {`
`13`	`13`	`return dfs(inorder, 0, inorder.size() - 1);`
`14`	`14`	`}`
`15`	`15`
`16`		`- private List<Integer> inorder(TreeNode _root, List<Integer> _list) {`
	`16`	`+ static List<Integer> inorder(TreeNode _root, List<Integer> _list) {`
`17`	`17`	`if (_root == null) {`
`18`	`18`	`return _list;`
`19`	`19`	`}`
`@@ -22,7 +22,7 @@ private List<Integer> inorder(TreeNode _root, List<Integer> _list) {`
`22`	`22`	`return inorder(_root.right, _list);`
`23`	`23`	`}`
`24`	`24`
`25`		`- private TreeNode dfs(List<Integer> _nums, int _start, int _end) {`
	`25`	`+ static TreeNode dfs(List<Integer> _nums, int _start, int _end) {`
`26`	`26`	`if (_end < _start) {`
`27`	`27`	`return null;`
`28`	`28`	`}`