refactor 270

fishercoder1534 · fishercoder1534 · commit 05c3cdf1463a · 2018-11-14T07:36:22.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_270.java b/src/main/java/com/fishercoder/solutions/_270.java
@@ -2,15 +2,10 @@
 
 import com.fishercoder.common.classes.TreeNode;
 
-/**Given a non-empty binary search tree and a target value, find the value in the BST that is closest to the target.
-
- Note:
- Given target value is a floating point.
- You are guaranteed to have only one unique value in the BST that is closest to the target.*/
 public class _270 {
 
-    class GeneralTreeSolution {
-        //this finished in 1 ms
+    public static class Solution1 {
+        //A general tree solution, this finished in 1 ms
         public int closestValue(TreeNode root, double target) {
             if (root == null) {
                 return 0;
@@ -36,8 +31,9 @@ private int dfs(TreeNode root, double target, double delta, int closestVal) {
         }
     }
 
-    class BSTSolutionRecursive {
-        //we can tailor the solution to use the BST feature: left subtrees are always smaller than the root the right subtrees
+    public static class Solution2 {
+        // BST solution
+        // we can tailor the solution to use the BST feature: left subtrees are always smaller than the root the right subtrees
         //this finished in 0 ms
         public int closestValue(TreeNode root, double target) {
             if (root == null) {
@@ -62,7 +58,8 @@ private int dfs(TreeNode root, double target, int minVal) {
         }
     }
 
-    class GeneralTreeSolutionMoreConcise {
+    public static class Solution3 {
+        //a more concise solution
         public int closestValue(TreeNode root, double target) {
             if (root == null) {
                 return 0;
@@ -83,7 +80,8 @@ private int dfs(TreeNode root, double target, int minVal) {
         }
     }
 
-    class BSTSolutionIterative {
+    public static class Solution4 {
+        //BST iterative solution
         public int closestValue(TreeNode root, double target) {
             long minVal = Long.MAX_VALUE;
             while (root != null) {
