feat: add solutions to lc problem: No.0916

doocs · Jan 16, 2025 · ce7cc57 · ce7cc57
1 parent 58c2190
commit ce7cc57
Show file tree

Hide file tree

Showing 4 changed files with 182 additions and 0 deletions.
diff --git a/solution/0900-0999/0916.Word Subsets/README.md b/solution/0900-0999/0916.Word Subsets/README.md
@@ -225,6 +225,70 @@ func wordSubsets(words1 []string, words2 []string) (ans []string) {
 }
 ```
 
+#### TypeScript
+
+```ts
+function wordSubsets(words1: string[], words2: string[]): string[] {
+    const cnt2 = new Map<string, number>();
+
+    for (const b of words2) {
+        const cnt = new Map<string, number>();
+        for (const c of b) {
+            cnt.set(c, (cnt.get(c) ?? 0) + 1);
+        }
+
+        for (const [k, v] of cnt) {
+            cnt2.set(k, Math.max(cnt2.get(k) ?? 0, v));
+        }
+    }
+
+    return words1.filter(a => {
+        const cnt1 = new Map<string, number>();
+        for (const c of a) {
+            cnt1.set(c, (cnt1.get(c) ?? 0) + 1);
+        }
+
+        for (const [k, v] of cnt2) {
+            if ((cnt1.get(k) ?? 0) < v) return false;
+        }
+
+        return true;
+    });
+}
+```
+
+#### JavaScript
+
+```js
+function wordSubsets(words1, words2) {
+    const cnt2 = new Map();
+
+    for (const b of words2) {
+        const cnt = new Map();
+        for (const c of b) {
+            cnt.set(c, (cnt.get(c) ?? 0) + 1);
+        }
+
+        for (const [k, v] of cnt) {
+            cnt2.set(k, Math.max(cnt2.get(k) ?? 0, v));
+        }
+    }
+
+    return words1.filter(a => {
+        const cnt1 = new Map();
+        for (const c of a) {
+            cnt1.set(c, (cnt1.get(c) ?? 0) + 1);
+        }
+
+        for (const [k, v] of cnt2) {
+            if ((cnt1.get(k) ?? 0) < v) return false;
+        }
+
+        return true;
+    });
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

diff --git a/solution/0900-0999/0916.Word Subsets/README_EN.md b/solution/0900-0999/0916.Word Subsets/README_EN.md
@@ -209,6 +209,70 @@ func wordSubsets(words1 []string, words2 []string) (ans []string) {
 }
 ```
 
+#### TypeScript
+
+```ts
+function wordSubsets(words1: string[], words2: string[]): string[] {
+    const cnt2 = new Map<string, number>();
+
+    for (const b of words2) {
+        const cnt = new Map<string, number>();
+        for (const c of b) {
+            cnt.set(c, (cnt.get(c) ?? 0) + 1);
+        }
+
+        for (const [k, v] of cnt) {
+            cnt2.set(k, Math.max(cnt2.get(k) ?? 0, v));
+        }
+    }
+
+    return words1.filter(a => {
+        const cnt1 = new Map<string, number>();
+        for (const c of a) {
+            cnt1.set(c, (cnt1.get(c) ?? 0) + 1);
+        }
+
+        for (const [k, v] of cnt2) {
+            if ((cnt1.get(k) ?? 0) < v) return false;
+        }
+
+        return true;
+    });
+}
+```
+
+#### JavaScript
+
+```js
+function wordSubsets(words1, words2) {
+    const cnt2 = new Map();
+
+    for (const b of words2) {
+        const cnt = new Map();
+        for (const c of b) {
+            cnt.set(c, (cnt.get(c) ?? 0) + 1);
+        }
+
+        for (const [k, v] of cnt) {
+            cnt2.set(k, Math.max(cnt2.get(k) ?? 0, v));
+        }
+    }
+
+    return words1.filter(a => {
+        const cnt1 = new Map();
+        for (const c of a) {
+            cnt1.set(c, (cnt1.get(c) ?? 0) + 1);
+        }
+
+        for (const [k, v] of cnt2) {
+            if ((cnt1.get(k) ?? 0) < v) return false;
+        }
+
+        return true;
+    });
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

diff --git a/solution/0900-0999/0916.Word Subsets/Solution.js b/solution/0900-0999/0916.Word Subsets/Solution.js
@@ -0,0 +1,27 @@
+function wordSubsets(words1, words2) {
+    const cnt2 = new Map();
+
+    for (const b of words2) {
+        const cnt = new Map();
+        for (const c of b) {
+            cnt.set(c, (cnt.get(c) ?? 0) + 1);
+        }
+
+        for (const [k, v] of cnt) {
+            cnt2.set(k, Math.max(cnt2.get(k) ?? 0, v));
+        }
+    }
+
+    return words1.filter(a => {
+        const cnt1 = new Map();
+        for (const c of a) {
+            cnt1.set(c, (cnt1.get(c) ?? 0) + 1);
+        }
+
+        for (const [k, v] of cnt2) {
+            if ((cnt1.get(k) ?? 0) < v) return false;
+        }
+
+        return true;
+    });
+}
diff --git a/solution/0900-0999/0916.Word Subsets/Solution.ts b/solution/0900-0999/0916.Word Subsets/Solution.ts
@@ -0,0 +1,27 @@
+function wordSubsets(words1: string[], words2: string[]): string[] {
+    const cnt2 = new Map<string, number>();
+
+    for (const b of words2) {
+        const cnt = new Map<string, number>();
+        for (const c of b) {
+            cnt.set(c, (cnt.get(c) ?? 0) + 1);
+        }
+
+        for (const [k, v] of cnt) {
+            cnt2.set(k, Math.max(cnt2.get(k) ?? 0, v));
+        }
+    }
+
+    return words1.filter(a => {
+        const cnt1 = new Map<string, number>();
+        for (const c of a) {
+            cnt1.set(c, (cnt1.get(c) ?? 0) + 1);
+        }
+
+        for (const [k, v] of cnt2) {
+            if ((cnt1.get(k) ?? 0) < v) return false;
+        }
+
+        return true;
+    });
+}