refactor 68

fishercoder1534 · fishercoder1534 · commit fe624110592f · 2018-01-31T07:34:33.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_68.java b/src/main/java/com/fishercoder/solutions/_68.java
@@ -4,12 +4,14 @@
 import java.util.List;
 
 /**
- * Given an array of words and a length L, format the text such that each line has exactly L characters and is fully (left and right) justified.
-
- You should pack your words in a greedy approach; that is, pack as many words as you can in each line. Pad extra spaces ' ' when necessary so that each line has exactly L characters.
-
- Extra spaces between words should be distributed as evenly as possible. If the number of spaces on a line do not divide evenly between words, the empty slots on the left will be assigned more spaces than the slots on the right.
+ * 68. Text Justification
 
+ Given an array of words and a length L, format the text such that each line has exactly L characters and is fully (left and right) justified.
+ You should pack your words in a greedy approach; that is, pack as many words as you can in each line.
+ Pad extra spaces ' ' when necessary so that each line has exactly L characters.
+ Extra spaces between words should be distributed as evenly as possible.
+ If the number of spaces on a line do not divide evenly between words,
+ the empty slots on the left will be assigned more spaces than the slots on the right.
  For the last line of text, it should be left justified and no extra space is inserted between words.
 
  For example,
@@ -22,17 +24,17 @@
  "example  of text",
  "justification.  "
  ]
- Note: Each word is guaranteed not to exceed L in length.
 
- click to show corner cases.
+ Note: Each word is guaranteed not to exceed L in length.
 
  Corner Cases:
  A line other than the last line might contain only one word. What should you do in this case?
  In this case, that line should be left-justified.
  */
 public class _68 {
 
-    public static List<String> fullJustify(String[] words, int L) {
+  public static class Solution1 {
+    public List<String> fullJustify(String[] words, int L) {
         ArrayList<String> result = new ArrayList();
         if (words == null || words.length == 0) {
             return result;
@@ -82,14 +84,6 @@ public static List<String> fullJustify(String[] words, int L) {
         result.add(sb.toString());
         return result;
     }
+  }
 
-    public static void main(String... args) {
-//        String[] words = new String[]{"This", "is", "an", "example", "of", "text", "justification."};
-        String[] words = new String[]{"This", "is", "a", "good", "test!", "\n", "What", "do", "you", "\n", "think?", "\n", "I", "think", "so", "too!"};
-        int L = 16;
-        List<String> result = fullJustify(words, L);
-        for (String str : result) {
-            System.out.println(str);
-        }
-    }
 }
diff --git a/src/test/java/com/fishercoder/_68Test.java b/src/test/java/com/fishercoder/_68Test.java
@@ -0,0 +1,39 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._68;
+import java.util.Arrays;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _68Test {
+  private static _68.Solution1 solution1;
+  private static String[] words;
+
+  @BeforeClass
+  public static void setup() {
+    solution1 = new _68.Solution1();
+  }
+
+  @Test
+  public void test1() {
+    words =
+        new String[] {"This", "is", "a", "good", "test!", "\n", "What", "do", "you", "\n", "think?",
+            "\n", "I", "think", "so", "too!"};
+    assertEquals(Arrays.asList(
+        "This  is  a good",
+        "test!  \n What do",
+        "you \n think? \n I",
+        "think so too!   "), solution1.fullJustify(words, 16));
+  }
+
+  @Test
+  public void test2() {
+    words = new String[] {"This", "is", "an", "example", "of", "text", "justification."};
+    assertEquals(Arrays.asList(
+        "This    is    an",
+        "example  of text",
+        "justification.  "), solution1.fullJustify(words, 16));
+  }
+}
