refactor 186

Author: fishercoder1534

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

@@ -1,6 +1,8 @@
 package com.fishercoder.solutions;
 
 /**
+ * 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.
 
  The input string does not contain leading or trailing spaces and the words are always separated by a single space.
@@ -32,10 +34,8 @@ public void reverseWords(char[] s) {
     private void reverse(char[] s, int start, int end) {
         while (start < end) {
             char temp = s[start];
-            s[start] = s[end];
-            s[end] = temp;
-            start++;
-            end--;
+            s[start++] = s[end];
+            s[end--] = temp;
         }
     }
 

src/test/java/com/fishercoder/_186Test.java

@@ -0,0 +1,27 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._186;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+
+public class _186Test {
+    private static _186 test;
+    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);
+    }
+
+}