refactor 96

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_96.java

@@ -1,6 +1,8 @@
 package com.fishercoder.solutions;
 
 /**
+ * 96. Unique Binary Search Trees
+ *
  * Given n, how many structurally unique BST's (binary search trees) that store values 1...n?
 
  For example,
@@ -15,17 +17,18 @@
  */
 public class _96 {
 
-    public int numTrees(int n) {
-        int[] G = new int[n + 1];
-        G[0] = G[1] = 1;
+    public static class Solution1 {
+        public int numTrees(int n) {
+            int[] G = new int[n + 1];
+            G[0] = G[1] = 1;
 
-        for (int i = 2; i <= n; ++i) {
-            for (int j = 1; j <= i; ++j) {
-                int temp = G[j - 1] * G[i - j];
-                G[i] = G[i] + temp;
+            for (int i = 2; i <= n; ++i) {
+                for (int j = 1; j <= i; ++j) {
+                    int temp = G[j - 1] * G[i - j];
+                    G[i] = G[i] + temp;
+                }
             }
+            return G[n];
         }
-        return G[n];
     }
-
 }