feat: add solutions to lc problem: No.1189

No.1189.Maximum Number of Balloons

Author: zhaocchen

solution/1100-1199/1189.Maximum Number of Balloons/README.md

@@ -86,6 +86,27 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maxNumberOfBalloons(text: string): number {
+    let targets: Set<string> = new Set('balloon'.split(''));
+    let cnt = new Array(126).fill(0);
+    for (let char of text) {
+        if (targets.has(char)) {
+            cnt[char.charCodeAt(0)]++;
+        }
+    }
+    cnt['l'.charCodeAt(0)] >>= 1;
+    cnt['o'.charCodeAt(0)] >>= 1;
+    let ans = Number.MAX_SAFE_INTEGER;
+    for (let char of targets) {
+        ans = Math.min(cnt[char.charCodeAt(0)], ans);
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/1100-1199/1189.Maximum Number of Balloons/README_EN.md

@@ -77,6 +77,27 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maxNumberOfBalloons(text: string): number {
+    let targets: Set<string> = new Set('balloon'.split(''));
+    let cnt = new Array(126).fill(0);
+    for (let char of text) {
+        if (targets.has(char)) {
+            cnt[char.charCodeAt(0)]++;
+        }
+    }
+    cnt['l'.charCodeAt(0)] >>= 1;
+    cnt['o'.charCodeAt(0)] >>= 1;
+    let ans = Number.MAX_SAFE_INTEGER;
+    for (let char of targets) {
+        ans = Math.min(cnt[char.charCodeAt(0)], ans);
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/1100-1199/1189.Maximum Number of Balloons/Solution.ts

@@ -0,0 +1,16 @@
+function maxNumberOfBalloons(text: string): number {
+    let targets: Set<string> = new Set('balloon'.split(''));
+    let cnt = new Array(126).fill(0);
+    for (let char of text) {
+        if (targets.has(char)) {
+            cnt[char.charCodeAt(0)]++;
+        }
+    }
+    cnt['l'.charCodeAt(0)] >>= 1;
+    cnt['o'.charCodeAt(0)] >>= 1;
+    let ans = Number.MAX_SAFE_INTEGER;
+    for (let char of targets) {
+        ans = Math.min(cnt[char.charCodeAt(0)], ans);
+    }
+    return ans;
+};