Create 1189_Maximum_Number_of_Balloons.java (qiyuangong#52)

ChesterChangLiu · web-flow · commit e813142e8037 · 2022-03-13T13:39:55.000+08:00
* Create 1189_Maximum_Number_of_Balloons.java * Create 1374_Generate_a_String_With_Characters_That_Have_Odd_Counts_Solution.py Contributed by @ChesterChangLiu
diff --git a/java/1189_Maximum_Number_of_Balloons.java b/java/1189_Maximum_Number_of_Balloons.java
@@ -0,0 +1,19 @@
+class Solution {
+    public int maxNumberOfBalloons(String text) {
+        HashMap<Character, Integer> map = new HashMap<>();
+        
+        for (char ch : text.toCharArray()) {
+            map.put(ch, map.getOrDefault(ch, 0) + 1);
+        }
+        
+        int res = Integer.MAX_VALUE;
+        
+        res = Math.min(res, map.getOrDefault('b', 0));
+        res = Math.min(res, map.getOrDefault('a', 0));
+        res = Math.min(res, map.getOrDefault('n', 0));
+        res = Math.min(res, map.getOrDefault('l', 0) / 2);
+        res = Math.min(res, map.getOrDefault('o', 0) / 2);
+        
+        return res;
+    }
+}
diff --git a/python/1374_Generate_a_String_With_Characters_That_Have_Odd_Counts_Solution.py b/python/1374_Generate_a_String_With_Characters_That_Have_Odd_Counts_Solution.py
@@ -0,0 +1,12 @@
+'''
+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.  
+ Input: n = 4
+Output: "pppz"
+'''
+class Solution:
+    def generateTheString(self, n: int) -> str:
+        if n%2==0:
+            return "a" * (n-1) + "b"
+        else:
+            return "a" * n
