feat: add ts solution to lcci problem: No.17.07

No.17.07.Baby Names
yejiaming · Apr 1, 2022 · 0e53cdc · 0e53cdc
1 parent af6c87f
commit 0e53cdc
Show file tree

Hide file tree

Showing 3 changed files with 94 additions and 0 deletions.
diff --git a/lcci/17.07.Baby Names/README.md b/lcci/17.07.Baby Names/README.md
@@ -147,6 +147,39 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function trulyMostPopular(names: string[], synonyms: string[]): string[] {
+    const map = new Map<string, string>();
+    for (const synonym of synonyms) {
+        const [k1, k2] = [...synonym]
+            .slice(1, synonym.length - 1)
+            .join('')
+            .split(',');
+        const [v1, v2] = [map.get(k1) ?? k1, map.get(k2) ?? k2];
+        const min = v1 < v2 ? v1 : v2;
+        const max = v1 < v2 ? v2 : v1;
+        map.set(k1, min);
+        map.set(k2, min);
+        for (const [k, v] of map.entries()) {
+            if (v === max) {
+                map.set(k, min);
+            }
+        }
+    }
+
+    const keyCount = new Map<string, number>();
+    for (const name of names) {
+        const num = name.match(/\d+/)[0];
+        const k = name.split('(')[0];
+        const key = map.get(k) ?? k;
+        keyCount.set(key, (keyCount.get(key) ?? 0) + Number(num));
+    }
+    return [...keyCount.entries()].map(([k, v]) => `${k}(${v})`);
+}
+```
+
 ### **...**
 
 ```

diff --git a/lcci/17.07.Baby Names/README_EN.md b/lcci/17.07.Baby Names/README_EN.md
@@ -139,6 +139,39 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function trulyMostPopular(names: string[], synonyms: string[]): string[] {
+    const map = new Map<string, string>();
+    for (const synonym of synonyms) {
+        const [k1, k2] = [...synonym]
+            .slice(1, synonym.length - 1)
+            .join('')
+            .split(',');
+        const [v1, v2] = [map.get(k1) ?? k1, map.get(k2) ?? k2];
+        const min = v1 < v2 ? v1 : v2;
+        const max = v1 < v2 ? v2 : v1;
+        map.set(k1, min);
+        map.set(k2, min);
+        for (const [k, v] of map.entries()) {
+            if (v === max) {
+                map.set(k, min);
+            }
+        }
+    }
+
+    const keyCount = new Map<string, number>();
+    for (const name of names) {
+        const num = name.match(/\d+/)[0];
+        const k = name.split('(')[0];
+        const key = map.get(k) ?? k;
+        keyCount.set(key, (keyCount.get(key) ?? 0) + Number(num));
+    }
+    return [...keyCount.entries()].map(([k, v]) => `${k}(${v})`);
+}
+```
+
 ### **...**
 
 ```

diff --git a/lcci/17.07.Baby Names/Solution.ts b/lcci/17.07.Baby Names/Solution.ts
@@ -0,0 +1,28 @@
+function trulyMostPopular(names: string[], synonyms: string[]): string[] {
+    const map = new Map<string, string>();
+    for (const synonym of synonyms) {
+        const [k1, k2] = [...synonym]
+            .slice(1, synonym.length - 1)
+            .join('')
+            .split(',');
+        const [v1, v2] = [map.get(k1) ?? k1, map.get(k2) ?? k2];
+        const min = v1 < v2 ? v1 : v2;
+        const max = v1 < v2 ? v2 : v1;
+        map.set(k1, min);
+        map.set(k2, min);
+        for (const [k, v] of map.entries()) {
+            if (v === max) {
+                map.set(k, min);
+            }
+        }
+    }
+
+    const keyCount = new Map<string, number>();
+    for (const name of names) {
+        const num = name.match(/\d+/)[0];
+        const k = name.split('(')[0];
+        const key = map.get(k) ?? k;
+        keyCount.set(key, (keyCount.get(key) ?? 0) + Number(num));
+    }
+    return [...keyCount.entries()].map(([k, v]) => `${k}(${v})`);
+}