refactor 108

fishercoder1534 · fishercoder1534 · commit 0cc223a04577 · 2021-10-26T16:27:11.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_108.java b/src/main/java/com/fishercoder/solutions/_108.java
@@ -9,15 +9,15 @@ public TreeNode sortedArrayToBST(int[] num) {
             return dfs(num, 0, num.length - 1);
         }
 
-        public TreeNode dfs(int[] num, int start, int end) {
-            if (start > end) {
+        public TreeNode dfs(int[] num, int left, int right) {
+            if (left > right) {
                 return null;
             }
-            int mid = (end + start) / 2;
-            TreeNode root = new TreeNode(num[mid]);
-            root.left = dfs(num, start, mid - 1);
-            root.right = dfs(num, mid + 1, end);
-            return root;
+            int mid = left + (right - left) / 2;
+            TreeNode node = new TreeNode(num[mid]);
+            node.left = dfs(num, left, mid - 1);
+            node.right = dfs(num, mid + 1, right);
+            return node;
         }
     }
 }

Original file line number	Diff line number	Diff line change
`@@ -9,15 +9,15 @@ public TreeNode sortedArrayToBST(int[] num) {`
`9`	`9`	`return dfs(num, 0, num.length - 1);`
`10`	`10`	`}`
`11`	`11`
`12`		`- public TreeNode dfs(int[] num, int start, int end) {`
`13`		`- if (start > end) {`
	`12`	`+ public TreeNode dfs(int[] num, int left, int right) {`
	`13`	`+ if (left > right) {`
`14`	`14`	`return null;`
`15`	`15`	`}`
`16`		`- int mid = (end + start) / 2;`
`17`		`- TreeNode root = new TreeNode(num[mid]);`
`18`		`- root.left = dfs(num, start, mid - 1);`
`19`		`- root.right = dfs(num, mid + 1, end);`
`20`		`- return root;`
	`16`	`+ int mid = left + (right - left) / 2;`
	`17`	`+ TreeNode node = new TreeNode(num[mid]);`
	`18`	`+ node.left = dfs(num, left, mid - 1);`
	`19`	`+ node.right = dfs(num, mid + 1, right);`
	`20`	`+ return node;`
`21`	`21`	`}`
`22`	`22`	`}`
`23`	`23`	`}`