refactor format

Author: fishercoder1534

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

@@ -16,12 +16,12 @@
 public class _96 {
 
     public int numTrees(int n) {
-        int [] G = new int[n+1];
+        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];
+        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;
             }
         }

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

@@ -27,10 +27,10 @@ public boolean isInterleave(String s1, String s2, String s3) {
         for (int i = 0; i < m; i++) {
             if (s1.charAt(i) == s3.charAt(i)) {
                 dp[i + 1][0] = true;
-            } else {//if one char fails, that means it breaks, the rest of the chars won't matter any more.
+            } else {
+                //if one char fails, that means it breaks, the rest of the chars won't matter any more.
                 //Mian and I found one missing test case on Lintcode: ["b", "aabccc", "aabbbcb"]
                 //if we don't break, here, Lintcode could still accept this code, but Leetcode fails it.
-
                 break;
             }
         }