refactor 186

fishercoder1534 · fishercoder1534 · commit 02fc3f8a1197 · 2018-06-05T07:22:20.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_186.java b/src/main/java/com/fishercoder/solutions/_186.java
@@ -2,8 +2,8 @@
 
 /**
  * 186. Reverse Words in a String II
- *
- * Given an input string, reverse the string word by word. A word is defined as a sequence of non-space characters.
+
+ Given an input string, reverse the string word by word. A word is defined as a sequence of non-space characters.
 
  The input string does not contain leading or trailing spaces and the words are always separated by a single space.
 
@@ -14,29 +14,30 @@
  Could you do it in-place without allocating extra space?
  */
 public class _186 {
-
+  public static class Solution1 {
     public void reverseWords(char[] s) {
-        // Three steps to reverse
-        // 1, reverse the whole sentence
-        reverse(s, 0, s.length - 1);
-        // 2, reverse each word
-        int start = 0;
-        for (int i = 0; i < s.length; i++) {
-            if (s[i] == ' ') {
-                reverse(s, start, i - 1);
-                start = i + 1;
-            }
+      // Three steps to reverse
+      // 1, reverse the whole sentence
+      reverse(s, 0, s.length - 1);
+      // 2, reverse each word
+      int start = 0;
+      for (int i = 0; i < s.length; i++) {
+        if (s[i] == ' ') {
+          reverse(s, start, i - 1);
+          start = i + 1;
         }
-        // 3, reverse the last word, if there is only one word this will solve the corner case
-        reverse(s, start, s.length - 1);
+      }
+      // 3, reverse the last word, if there is only one word this will solve the corner case
+      reverse(s, start, s.length - 1);
     }
 
     private void reverse(char[] s, int start, int end) {
-        while (start < end) {
-            char temp = s[start];
-            s[start++] = s[end];
-            s[end--] = temp;
-        }
+      while (start < end) {
+        char temp = s[start];
+        s[start++] = s[end];
+        s[end--] = temp;
+      }
     }
+  }
 
 }
diff --git a/src/test/java/com/fishercoder/_186Test.java b/src/test/java/com/fishercoder/_186Test.java
@@ -7,21 +7,20 @@
 import static org.junit.Assert.assertArrayEquals;
 
 public class _186Test {
-    private static _186 test;
-    private static char[] s;
-    private static char[] expected;
+  private static _186.Solution1 solution1;
+  private static char[] s;
+  private static char[] expected;
 
-    @BeforeClass
-    public static void setup() {
-        test = new _186();
-    }
-
-    @Test
-    public void test1() {
-        s = new char[]{'h', 'i', '!'};
-        test.reverseWords(s);
-        expected = new char[]{'h', 'i', '!'};
-        assertArrayEquals(expected, s);
-    }
+  @BeforeClass
+  public static void setup() {
+    solution1 = new _186.Solution1();
+  }
 
+  @Test
+  public void test1() {
+    s = new char[] {'h', 'i', '!'};
+    solution1.reverseWords(s);
+    expected = new char[] {'h', 'i', '!'};
+    assertArrayEquals(expected, s);
+  }
 }
