refactor 541

fishercoder1534 · fishercoder1534 · commit f89622d74970 · 2019-06-19T07:25:49.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_541.java b/src/main/java/com/fishercoder/solutions/_541.java
@@ -1,6 +1,8 @@
 package com.fishercoder.solutions;
 
 /**
+ * 541. Reverse String II
+ *
  * Given a string and an integer k, you need to reverse the first k characters for every 2k characters counting from the start of the string.
  * If there are less than k characters left, reverse all of them.
  * If there are less than 2k but greater than or equal to k characters, then reverse the first k characters and left the other as original.
@@ -15,22 +17,23 @@
  */
 public class _541 {
 
-    public String reverseStr(String s, int k) {
-        StringBuilder stringBuilder = new StringBuilder();
-        for (int i = 0; i < s.length(); i = i + 2 * k) {
-            if (s.length() >= (i + k)) {
-                stringBuilder.append(new StringBuilder(s.substring(i, i + k)).reverse());
-            } else {
-                stringBuilder.append(new StringBuilder(s.substring(i)).reverse());
-                break;
-            }
-            if ((i + 2 * k) <= s.length()) {
-                stringBuilder.append(s.substring(i + k, i + 2 * k));
-            } else {
-                stringBuilder.append(s.substring(i + k));
+    public static class Solution1 {
+        public String reverseStr(String s, int k) {
+            StringBuilder stringBuilder = new StringBuilder();
+            for (int i = 0; i < s.length(); i = i + 2 * k) {
+                if (s.length() >= (i + k)) {
+                    stringBuilder.append(new StringBuilder(s.substring(i, i + k)).reverse());
+                } else {
+                    stringBuilder.append(new StringBuilder(s.substring(i)).reverse());
+                    break;
+                }
+                if ((i + 2 * k) <= s.length()) {
+                    stringBuilder.append(s.substring(i + k, i + 2 * k));
+                } else {
+                    stringBuilder.append(s.substring(i + k));
+                }
             }
+            return stringBuilder.toString();
         }
-        return stringBuilder.toString();
     }
-
 }
diff --git a/src/test/java/com/fishercoder/_541Test.java b/src/test/java/com/fishercoder/_541Test.java
@@ -8,15 +8,15 @@
 import static junit.framework.Assert.assertEquals;
 
 public class _541Test {
-    private static _541 test;
+    private static _541.Solution1 solution1;
     private static String expected;
     private static String actual;
     private static String s;
     private static int k;
 
     @BeforeClass
     public static void setup() {
-        test = new _541();
+        solution1 = new _541.Solution1();
     }
 
     @Before
@@ -28,7 +28,7 @@ public void test1() {
         s = "abcd";
         k = 5;
         expected = "dcba";
-        actual = test.reverseStr(s, k);
+        actual = solution1.reverseStr(s, k);
         assertEquals(expected, actual);
     }
 
@@ -37,7 +37,7 @@ public void test2() {
         s = "abcdefg";
         k = 2;
         expected = "bacdfeg";
-        actual = test.reverseStr(s, k);
+        actual = solution1.reverseStr(s, k);
         assertEquals(expected, actual);
     }
 
@@ -46,7 +46,7 @@ public void test3() {
         s = "abcd";
         k = 4;
         expected = "dcba";
-        actual = test.reverseStr(s, k);
+        actual = solution1.reverseStr(s, k);
         assertEquals(expected, actual);
     }
 
@@ -55,7 +55,7 @@ public void test4() {
         s = "abcdefg";
         k = 3;
         expected = "cbadefg";
-        actual = test.reverseStr(s, k);
+        actual = solution1.reverseStr(s, k);
         assertEquals(expected, actual);
     }
 
@@ -64,7 +64,7 @@ public void test5() {
         s = "abcd";
         k = 3;
         expected = "cbad";
-        actual = test.reverseStr(s, k);
+        actual = solution1.reverseStr(s, k);
         assertEquals(expected, actual);
     }
 
@@ -74,7 +74,7 @@ public void test6() {
         System.out.println("s.length() = " + s.length());
         k = 39;
         expected = "fdcqkmxwholhytmhafpesaentdvxginrjlyqzyhehybknvdmfrfvtbsovjbdhevlfxpdaovjgunjqllgsqddebemjanqcqnfkjmi";
-        actual = test.reverseStr(s, k);
+        actual = solution1.reverseStr(s, k);
         assertEquals(expected, actual);
     }
 
