https://leetcode.cn/problems/sum-of-prefix-scores-of-strings/

Author: masx200

README.md

@@ -10,6 +10,8 @@ leetcode 测试
 
 ##### 包含的内容如下
 
+https://leetcode.cn/problems/sum-of-prefix-scores-of-strings/
+
 https://leetcode.cn/problems/count-days-spent-together/
 
 https://leetcode.cn/problems/reverse-odd-levels-of-binary-tree/

implement-trie-prefix-tree/PrefixTreeSearchPrefix.ts

@@ -1,7 +1,4 @@
-import { TrieNode } from "../implement-trie-ii-prefix-tree/TrieNode.ts";
-import { PrefixTree } from "./PrefixTree.ts";
-
-export function PrefixTreeSearchPrefix<T extends PrefixTree | TrieNode>(
+export function PrefixTreeSearchPrefix<T extends { children: Map<string, T> }>(
     root: T,
     prefix: string,
     {

sum-of-prefix-scores-of-strings/index.ts

@@ -0,0 +1,30 @@
+import { TrieNode } from "../implement-trie-ii-prefix-tree/TrieNode.ts";
+import { TrieNodeInsert } from "../implement-trie-ii-prefix-tree/TrieNodeInsert.ts";
+import { PrefixTreeSearchPrefix } from "../implement-trie-prefix-tree/PrefixTreeSearchPrefix.ts";
+function sumPrefixScores(words: string[]): number[] {
+    const root = new TrieNode();
+    for (const word of words) {
+        TrieNodeInsert(root, word);
+    }
+    const word2sum = new Map<string, number>();
+    return words.map((word) => {
+        const sum = word2sum.get(word) ?? TrieNodeSum(root, word);
+        word2sum.set(word, sum);
+        return sum;
+    });
+}
+export default sumPrefixScores;
+
+function TrieNodeSum(root: TrieNode, word: string): number {
+    let sum = 0;
+    let index = 0;
+    PrefixTreeSearchPrefix(root, word, {
+        each(node) {
+            if (index) {
+                sum += node.prefixCount;
+            }
+            index++;
+        },
+    });
+    return sum;
+}