refactor 555

Author: fishercoder1534

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

@@ -1,21 +1,26 @@
 package com.fishercoder.solutions;
 
 /**
+ * 555. Split Concatenated Strings
+ *
  * Given a list of strings, you could concatenate these strings together into a loop,
  * where for each string you could choose to reverse it or not.
+ *
  * Among all the possible loops, you need to find the lexicographically biggest string after cutting the loop,
  * which will make the looped string into a regular one.
+ *
  * Specifically, to find the lexicographically biggest string, you need to experience two phases:
-
- Concatenate all the strings into a loop, where you can reverse some strings or not and connect them in the same order as given.
-
- Cut and make one breakpoint in any place of the loop, which will make the looped string into a regular one starting from the character at the cutpoint.
-
- And your job is to find the lexicographically biggest one among all the possible regular strings.
+ *
+ * 1. Concatenate all the strings into a loop, where you can reverse some strings or not and connect them in the same order as given.
+ * 2. Cut and make one breakpoint in any place of the loop, which will make the looped string into a regular one starting from
+ * the character at the cutpoint.
+ *
+ * And your job is to find the lexicographically biggest one among all the possible regular strings.
 
  Example:
  Input: "abc", "xyz"
  Output: "zyxcba"
+
  Explanation: You can get the looped string "-abcxyz-", "-abczyx-", "-cbaxyz-", "-cbazyx-",
  where '-' represents the looped status.
  The answer string came from the fourth looped one,
@@ -28,23 +33,27 @@
  */
 public class _555 {
 
-    //credit: https://discuss.leetcode.com/topic/86477/neat-java-solution and article: https://leetcode.com/articles/split-assembled-strings/#approach-3-optimized-solution-accepted
+    /**
+     * credit: https://discuss.leetcode.com/topic/86477/neat-java-solution
+     * and article: https://leetcode.com/articles/split-assembled-strings/#approach-3-optimized-solution-accepted
+     */
     public String splitLoopedString(String[] strs) {
-        StringBuilder stringBuilder = new StringBuilder();
+        StringBuilder sb = new StringBuilder();
         for (int i = 0; i < strs.length; i++) {
-            stringBuilder.setLength(0);
-            String reverse = stringBuilder.append(strs[i]).reverse().toString();
+            sb.setLength(0);
+            String reverse = sb.append(strs[i]).reverse().toString();
             if (strs[i].compareTo(reverse) < 0) {
                 strs[i] = reverse;
             }
         }
         String result = "";
         for (int i = 0; i < strs.length; i++) {
-            stringBuilder.setLength(0);
-            String reverse = stringBuilder.append(strs[i]).reverse().toString();
+            sb.setLength(0);
+            String reverse = sb.append(strs[i]).reverse().toString();
             for (String str : new String[]{strs[i], reverse}) {
                 for (int k = 0; k < str.length(); k++) {
-                    StringBuilder sb = new StringBuilder(str.substring(k));
+                    sb.setLength(0);
+                    sb.append(str.substring(k));
                     for (int j = i + 1; j < strs.length; j++) {
                         sb.append(strs[j]);
                     }

src/test/java/com/fishercoder/_555Test.java

@@ -27,4 +27,12 @@ public void test1() {
         actual = test.splitLoopedString(strs);
         assertEquals(expected, actual);
     }
+
+    @Test
+    public void test2() {
+        strs = new String[]{"lc", "evol", "cdy"};
+        expected = "ylclovecd";
+        actual = test.splitLoopedString(strs);
+        assertEquals(expected, actual);
+    }
 }