add 1417

fishercoder1534 · fishercoder1534 · commit 73ba8d14b691 · 2020-04-19T10:34:12.000-07:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1419|[Reformat The String](https://leetcode.com/problems/reformat-the-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1419.java) | |Easy|String|
 |1415|[The k-th Lexicographical String of All Happy Strings of Length n](https://leetcode.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1415.java) | |Medium|Backtracking|
 |1413|[Minimum Value to Get Positive Step by Step Sum](https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1413.java) | |Easy|Array|
 |1410|[HTML Entity Parser](https://leetcode.com/problems/html-entity-parser/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1410.java) | |Medium|String, Stack|
diff --git a/src/main/java/com/fishercoder/solutions/_1417.java b/src/main/java/com/fishercoder/solutions/_1417.java
@@ -0,0 +1,79 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.List;
+
+/**
+ * 1417. Reformat The String
+ *
+ * Given alphanumeric string s. (Alphanumeric string is a string consisting of lowercase English letters and digits).
+ * You have to find a permutation of the string where no letter is followed by another letter and no digit is followed by another digit.
+ * That is, no two adjacent characters have the same type.
+ * Return the reformatted string or return an empty string if it is impossible to reformat the string.
+ *
+ * Example 1:
+ * Input: s = "a0b1c2"
+ * Output: "0a1b2c"
+ * Explanation: No two adjacent characters have the same type in "0a1b2c". "a0b1c2", "0a1b2c", "0c2a1b" are also valid permutations.
+ *
+ * Example 2:
+ * Input: s = "leetcode"
+ * Output: ""
+ * Explanation: "leetcode" has only characters so we cannot separate them by digits.
+ *
+ * Example 3:
+ * Input: s = "1229857369"
+ * Output: ""
+ * Explanation: "1229857369" has only digits so we cannot separate them by characters.
+ *
+ * Example 4:
+ * Input: s = "covid2019"
+ * Output: "c2o0v1i9d"
+ *
+ * Example 5:
+ * Input: s = "ab123"
+ * Output: "1a2b3"
+ *
+ * Constraints:
+ * 1 <= s.length <= 500
+ * s consists of only lowercase English letters and/or digits.
+ * */
+public class _1417 {
+    public static class Solution1 {
+        public String reformat(String s) {
+            List<Character> characterList = new ArrayList<>();
+            List<Character> numberList = new ArrayList<>();
+            for (char c : s.toCharArray()) {
+                if (Character.isAlphabetic(c)) {
+                    characterList.add(c);
+                } else {
+                    numberList.add(c);
+                }
+            }
+            if (Math.abs(characterList.size() - numberList.size()) > 1) {
+                return "";
+            } else {
+                StringBuilder sb = new StringBuilder();
+                if (characterList.size() > numberList.size()) {
+                    for (int i = 0; i < characterList.size() - 1; i++) {
+                        sb.append(characterList.get(i));
+                        sb.append(numberList.get(i));
+                    }
+                    sb.append(characterList.get(characterList.size() - 1));
+                } else if (characterList.size() == numberList.size()) {
+                    for (int i = 0; i < numberList.size(); i++) {
+                        sb.append(numberList.get(i));
+                        sb.append(characterList.get(i));
+                    }
+                } else {
+                    for (int i = 0; i < numberList.size() - 1; i++) {
+                        sb.append(numberList.get(i));
+                        sb.append(characterList.get(i));
+                    }
+                    sb.append(numberList.get(numberList.size() - 1));
+                }
+                return sb.toString();
+            }
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1417Test.java b/src/test/java/com/fishercoder/_1417Test.java
@@ -0,0 +1,27 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1417;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1417Test {
+    private static _1417.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1417.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals("0a1b2c", solution1.reformat("a0b1c2"));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals("c2o0v1i9d", solution1.reformat("covid2019"));
+    }
+
+}
