add 1400

fishercoder1534 · fishercoder1534 · commit d1f353bad6e7 · 2020-04-04T09:15:02.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                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1400|[Construct K Palindrome Strings](https://leetcode.com/problems/construct-k-palindrome-strings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1400.java) | |Medium|Greedy|
 |1396|[Design Underground System](https://leetcode.com/problems/design-underground-system/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1396.java) | |Medium|Design|
 |1395|[Count Number of Teams](https://leetcode.com/problems/count-number-of-teams/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1395.java) | |Medium|Array|
 |1394|[Find Lucky Integer in an Array](https://leetcode.com/problems/find-lucky-integer-in-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1394.java) | |Easy|Array|
diff --git a/src/main/java/com/fishercoder/solutions/_1400.java b/src/main/java/com/fishercoder/solutions/_1400.java
@@ -0,0 +1,62 @@
+package com.fishercoder.solutions;
+
+import java.util.HashMap;
+import java.util.Map;
+
+/**
+ * 1400. Construct K Palindrome Strings
+ *
+ * Given a string s and an integer k. You should construct k non-empty palindrome strings using all the characters in s.
+ * Return True if you can use all the characters in s to construct k palindrome strings or False otherwise.
+ *
+ * Example 1:
+ * Input: s = "annabelle", k = 2
+ * Output: true
+ * Explanation: You can construct two palindromes using all characters in s.
+ * Some possible constructions "anna" + "elble", "anbna" + "elle", "anellena" + "b"
+ *
+ * Example 2:
+ * Input: s = "leetcode", k = 3
+ * Output: false
+ * Explanation: It is impossible to construct 3 palindromes using all the characters of s.
+ *
+ * Example 3:
+ * Input: s = "true", k = 4
+ * Output: true
+ * Explanation: The only possible solution is to put each character in a separate string.
+ *
+ * Example 4:
+ * Input: s = "yzyzyzyzyzyzyzy", k = 2
+ * Output: true
+ * Explanation: Simply you can put all z's in one string and all y's in the other string. Both strings will be palindrome.
+ *
+ * Example 5:
+ * Input: s = "cr", k = 7
+ * Output: false
+ * Explanation: We don't have enough characters in s to construct 7 palindromes.
+ *
+ * Constraints:
+ * 1 <= s.length <= 10^5
+ * All characters in s are lower-case English letters.
+ * 1 <= k <= 10^5
+ * */
+public class _1400 {
+    public static class Solution1 {
+        public boolean canConstruct(String s, int k) {
+            if (s.length() < k) {
+                return false;
+            }
+            Map<Character, Integer> map = new HashMap<>();
+            for (char c : s.toCharArray()) {
+                map.put(c, map.getOrDefault(c, 0) + 1);
+            }
+            int count = 0;
+            for (char c : map.keySet()) {
+                if (map.get(c) % 2 == 1) {
+                    count++;
+                }
+            }
+            return count <= k;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1400Test.java b/src/test/java/com/fishercoder/_1400Test.java
@@ -0,0 +1,52 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1400;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1400Test {
+    private static _1400.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1400.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(true, solution1.canConstruct("annabelle", 2));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(false, solution1.canConstruct("leetcode", 3));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(true, solution1.canConstruct("true", 4));
+    }
+
+    @Test
+    public void test4() {
+        assertEquals(true, solution1.canConstruct("yzyzyzyzyzyzyzy", 2));
+    }
+
+    @Test
+    public void test5() {
+        assertEquals(false, solution1.canConstruct("cr", 7));
+    }
+
+    @Test
+    public void test6() {
+        assertEquals(true, solution1.canConstruct("qlkzenwmmnpkopu", 15));
+    }
+
+    @Test
+    public void test7() {
+        assertEquals(true, solution1.canConstruct("jsautfnlcmwqpzycehdulmdencthhlzsnijd", 35));
+    }
+
+}
