add 1324

fishercoder1534 · fishercoder1534 · commit e1392fc3d137 · 2020-02-09T10:49:21.000-08:00
diff --git a/README.md b/README.md
@@ -22,6 +22,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1331|[Rank Transform of an Array](https://leetcode.com/problems/rank-transform-of-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1331.java) | |Easy||
 |1329|[Sort the Matrix Diagonally](https://leetcode.com/problems/sort-the-matrix-diagonally/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1329.java) | |Medium||
 |1325|[Delete Leaves With a Given Value](https://leetcode.com/problems/delete-leaves-with-a-given-value/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1325.java) | |Medium|Tree|
+|1324|[Print Words Vertically](https://leetcode.com/problems/print-words-vertically/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1324.java) | |Medium|String|
 |1323|[Maximum 69 Number](https://leetcode.com/problems/maximum-69-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1323.java) | |Easy|Math|
 |1317|[Convert Integer to the Sum of Two No-Zero Integers](https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1317.java) | |Easy||
 |1315|[Sum of Nodes with Even-Valued Grandparent](https://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1315.java) | |Medium|Tree, DFS|
diff --git a/src/main/java/com/fishercoder/solutions/_1324.java b/src/main/java/com/fishercoder/solutions/_1324.java
@@ -0,0 +1,77 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.List;
+
+/**
+ * 1324. Print Words Vertically
+ *
+ * Given a string s. Return all the words vertically in the same order in which they appear in s.
+ * Words are returned as a list of strings, complete with spaces when is necessary. (Trailing spaces are not allowed).
+ * Each word would be put on only one column and that in one column there will be only one word.
+ *
+ * Example 1:
+ * Input: s = "HOW ARE YOU"
+ * Output: ["HAY","ORO","WEU"]
+ * Explanation: Each word is printed vertically.
+ *  "HAY"
+ *  "ORO"
+ *  "WEU"
+ *
+ * Example 2:
+ * Input: s = "TO BE OR NOT TO BE"
+ * Output: ["TBONTB","OEROOE","   T"]
+ * Explanation: Trailing spaces is not allowed.
+ * "TBONTB"
+ * "OEROOE"
+ * "   T"
+ *
+ * Example 3:
+ * Input: s = "CONTEST IS COMING"
+ * Output: ["CIC","OSO","N M","T I","E N","S G","T"]
+ *
+ * Constraints:
+ * 1 <= s.length <= 200
+ * s contains only upper case English letters.
+ * It's guaranteed that there is only one space between 2 words.
+ * */
+public class _1324 {
+    public static class Solution1 {
+        public List<String> printVertically(String s) {
+            String[] words = s.split(" ");
+            int columnMax = 0;
+            for (String word : words) {
+                columnMax = Math.max(columnMax, word.length());
+            }
+            char[][] matrix = new char[words.length][columnMax];
+            for (int i = 0; i < words.length; i++) {
+                int j = 0;
+                for (; j < words[i].length(); j++) {
+                    matrix[i][j] = words[i].charAt(j);
+                }
+                while (j < columnMax) {
+                    matrix[i][j++] = '#';
+                }
+            }
+            List<String> result = new ArrayList<>();
+            for (int j = 0; j < columnMax; j++) {
+                StringBuilder sb = new StringBuilder();
+                for (int i = 0; i < matrix.length; i++) {
+                    if (matrix[i][j] != '#') {
+                        sb.append(matrix[i][j]);
+                    } else {
+                        sb.append(' ');
+                    }
+                }
+                String str = sb.toString();
+                int k = str.length() - 1;
+                while (k >= 0 && str.charAt(k) == ' ') {
+                    k--;
+                }
+                result.add(str.substring(0, k + 1));
+                sb.setLength(0);
+            }
+            return result;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1324Test.java b/src/test/java/com/fishercoder/_1324Test.java
@@ -0,0 +1,34 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1324;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import java.util.Arrays;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1324Test {
+    private static _1324.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1324.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(Arrays.asList("HAY", "ORO", "WEU"), solution1.printVertically("HOW ARE YOU"));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(Arrays.asList("TBONTB", "OEROOE", "   T"), solution1.printVertically("TO BE OR NOT TO BE"));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(Arrays.asList("CIC", "OSO", "N M", "T I", "E N", "S G", "T"), solution1.printVertically("CONTEST IS COMING"));
+    }
+
+}
