feat: add ts solution to lc problem: No.2416

No.2416.Sum of Prefix Scores of Strings

Author: yanglbme

solution/2400-2499/2416.Sum of Prefix Scores of Strings/README.md

@@ -290,6 +290,56 @@ function sumPrefixScores(words: string[]): number[] {
 }
 ```
 
+```ts
+class Trie {
+    children: Array<any>;
+    cnt: number;
+
+    constructor() {
+        this.children = Array(26);
+        this.cnt = 0;
+    }
+
+    insert(w: string): void {
+        let node = this;
+        for (const c of w) {
+            const idx = c.charCodeAt(0) - 'a'.charCodeAt(0);
+            if (!node.children[idx]) {
+                node.children[idx] = new Trie();
+            }
+            node = node.children[idx];
+            node.cnt++;
+        }
+    }
+
+    search(w: string): number {
+        let node = this;
+        let ans = 0;
+        for (const c of w) {
+            const idx = c.charCodeAt(0) - 'a'.charCodeAt(0);
+            if (!node.children[idx]) {
+                return ans;
+            }
+            node = node.children[idx];
+            ans += node.cnt;
+        }
+        return ans;
+    }
+}
+
+function sumPrefixScores(words: string[]): number[] {
+    const trie = new Trie();
+    for (const w of words) {
+        trie.insert(w);
+    }
+    let ans = [];
+    for (const w of words) {
+        ans.push(trie.search(w));
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/2400-2499/2416.Sum of Prefix Scores of Strings/README_EN.md

@@ -274,6 +274,56 @@ function sumPrefixScores(words: string[]): number[] {
 }
 ```
 
+```ts
+class Trie {
+    children: Array<any>;
+    cnt: number;
+
+    constructor() {
+        this.children = Array(26);
+        this.cnt = 0;
+    }
+
+    insert(w: string): void {
+        let node = this;
+        for (const c of w) {
+            const idx = c.charCodeAt(0) - 'a'.charCodeAt(0);
+            if (!node.children[idx]) {
+                node.children[idx] = new Trie();
+            }
+            node = node.children[idx];
+            node.cnt++;
+        }
+    }
+
+    search(w: string): number {
+        let node = this;
+        let ans = 0;
+        for (const c of w) {
+            const idx = c.charCodeAt(0) - 'a'.charCodeAt(0);
+            if (!node.children[idx]) {
+                return ans;
+            }
+            node = node.children[idx];
+            ans += node.cnt;
+        }
+        return ans;
+    }
+}
+
+function sumPrefixScores(words: string[]): number[] {
+    const trie = new Trie();
+    for (const w of words) {
+        trie.insert(w);
+    }
+    let ans = [];
+    for (const w of words) {
+        ans.push(trie.search(w));
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/2400-2499/2416.Sum of Prefix Scores of Strings/Solution.ts

@@ -1,21 +1,47 @@
-function sumPrefixScores(words: string[]): number[] {
-    const map = new Map();
+class Trie {
+    children: Array<any>;
+    cnt: number;
+
+    constructor() {
+        this.children = Array(26);
+        this.cnt = 0;
+    }
 
-    for (const word of words) {
-        const n = word.length;
-        for (let i = 1; i <= n; i++) {
-            const s = word.slice(0, i);
-            map.set(s, (map.get(s) ?? 0) + 1);
+    insert(w: string): void {
+        let node = this;
+        for (const c of w) {
+            const idx = c.charCodeAt(0) - 'a'.charCodeAt(0);
+            if (!node.children[idx]) {
+                node.children[idx] = new Trie();
+            }
+            node = node.children[idx];
+            node.cnt++;
         }
     }
 
-    return words.map(word => {
-        const n = word.length;
-        let count = 0;
-        for (let i = 1; i <= n; i++) {
-            const s = word.slice(0, i);
-            count += map.get(s);
+    search(w: string): number {
+        let node = this;
+        let ans = 0;
+        for (const c of w) {
+            const idx = c.charCodeAt(0) - 'a'.charCodeAt(0);
+            if (!node.children[idx]) {
+                return ans;
+            }
+            node = node.children[idx];
+            ans += node.cnt;
         }
-        return count;
-    });
+        return ans;
+    }
+}
+
+function sumPrefixScores(words: string[]): number[] {
+    const trie = new Trie();
+    for (const w of words) {
+        trie.insert(w);
+    }
+    let ans = [];
+    for (const w of words) {
+        ans.push(trie.search(w));
+    }
+    return ans;
 }