add 1374

fishercoder1534 · fishercoder1534 · commit a267360d57b3 · 2020-03-08T07:47:50.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                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1374|[Generate a String With Characters That Have Odd Counts](https://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1374.java) | |Easy||String
 |1373|[Maximum Sum BST in Binary Tree](https://leetcode.com/problems/maximum-sum-bst-in-binary-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1373.java) | |Hard||DP, BST
 |1372|[Longest ZigZag Path in a Binary Tree](https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1372.java) | |Hard||DP, Tree
 |1371|[Find the Longest Substring Containing Vowels in Even Counts](https://leetcode.com/problems/find-the-longest-substring-containing-vowels-in-even-counts/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1371.java) | |Medium||String
diff --git a/src/main/java/com/fishercoder/solutions/_1374.java b/src/main/java/com/fishercoder/solutions/_1374.java
@@ -0,0 +1,44 @@
+package com.fishercoder.solutions;
+
+/**
+ * 1374. Generate a String With Characters That Have Odd Counts
+ *
+ * Given an integer n, return a string with n characters such that each character in such string occurs an odd number of times.
+ * The returned string must contain only lowercase English letters. If there are multiples valid strings, return any of them.
+ *
+ * Example 1:
+ * Input: n = 4
+ * Output: "pppz"
+ * Explanation: "pppz" is a valid string since the character 'p' occurs three times and the character 'z' occurs once. Note that there are many other valid strings such as "ohhh" and "love".
+ *
+ * Example 2:
+ * Input: n = 2
+ * Output: "xy"
+ * Explanation: "xy" is a valid string since the characters 'x' and 'y' occur once. Note that there are many other valid strings such as "ag" and "ur".
+ *
+ * Example 3:
+ * Input: n = 7
+ * Output: "holasss"
+ *
+ * Constraints:
+ * 1 <= n <= 500
+ * */
+public class _1374 {
+    public static class Solution1 {
+        public String generateTheString(int n) {
+            StringBuilder sb = new StringBuilder();
+            if (n > 1 && n % 2 == 0) {
+                while (n-- > 1) {
+                    sb.append("a");
+                }
+            } else if (n > 1) {
+                while (n-- > 2) {
+                    sb.append("a");
+                }
+                sb.append("b");
+            }
+            sb.append("z");
+            return sb.toString();
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1374Test.java b/src/test/java/com/fishercoder/_1374Test.java
@@ -0,0 +1,37 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1374;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1374Test {
+    private static _1374.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1374.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(1, solution1.generateTheString(1).length());
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(4, solution1.generateTheString(4).length());
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(2, solution1.generateTheString(2).length());
+    }
+
+    @Test
+    public void test4() {
+        assertEquals(7, solution1.generateTheString(7).length());
+    }
+
+}
