feat: add js solution to lc problem: No.0729

solution/0700-0799/0729.My Calendar I/Solution.js

@@ -0,0 +1,26 @@
+
+var MyCalendar = function() {
+    this.calendar = [];
+};
+
+/** 
+ * @param {number} start 
+ * @param {number} end
+ * @return {boolean}
+ */
+MyCalendar.prototype.book = function(start, end) {
+    for (const item of this.calendar) {
+        if (end <= item[0] || item[1] <= start) {
+            continue;
+        }
+        return false;
+    }
+    this.calendar.push([start, end]);
+    return true;
+};
+
+/** 
+ * Your MyCalendar object will be instantiated and called as such:
+ * var obj = new MyCalendar()
+ * var param_1 = obj.book(start,end)
+ */

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

@@ -337,6 +337,53 @@ function sumPrefixScores(words: string[]): number[] {
 }
 ```
 
+#### JavaScript
+
+```js
+class Trie {
+    constructor() {
+        this.children = {};
+        this.cnt = 0;
+    }
+
+    insert(w) {
+        let node = this;
+        for (const c of w) {
+            if (!node.children[c]) {
+                node.children[c] = new Trie();
+            }
+            node = node.children[c];
+            node.cnt++;
+        }
+    }
+
+    search(w) {
+        let node = this;
+        let ans = 0;
+        for (const c of w) {
+            if (!node.children[c]) {
+                return ans;
+            }
+            node = node.children[c];
+            ans += node.cnt;
+        }
+        return ans;
+    }
+}
+
+/**
+ * @param {string[]} words
+ * @return {number[]}
+ */
+var sumPrefixScores = function (words) {
+    const trie = new Trie();
+    for (const w of words) {
+        trie.insert(w);
+    }
+    return words.map(w => trie.search(w));
+};
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

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

@@ -337,6 +337,53 @@ function sumPrefixScores(words: string[]): number[] {
 }
 ```
 
+#### JavaScript
+
+```js
+class Trie {
+    constructor() {
+        this.children = {};
+        this.cnt = 0;
+    }
+
+    insert(w) {
+        let node = this;
+        for (const c of w) {
+            if (!node.children[c]) {
+                node.children[c] = new Trie();
+            }
+            node = node.children[c];
+            node.cnt++;
+        }
+    }
+
+    search(w) {
+        let node = this;
+        let ans = 0;
+        for (const c of w) {
+            if (!node.children[c]) {
+                return ans;
+            }
+            node = node.children[c];
+            ans += node.cnt;
+        }
+        return ans;
+    }
+}
+
+/**
+ * @param {string[]} words
+ * @return {number[]}
+ */
+var sumPrefixScores = function (words) {
+    const trie = new Trie();
+    for (const w of words) {
+        trie.insert(w);
+    }
+    return words.map(w => trie.search(w));
+};
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

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

@@ -0,0 +1,42 @@
+class Trie {
+    constructor() {
+        this.children = {};
+        this.cnt = 0;
+    }
+
+    insert(w) {
+        let node = this;
+        for (const c of w) {
+            if (!node.children[c]) {
+                node.children[c] = new Trie();
+            }
+            node = node.children[c];
+            node.cnt++;
+        }
+    }
+
+    search(w) {
+        let node = this;
+        let ans = 0;
+        for (const c of w) {
+            if (!node.children[c]) {
+                return ans;
+            }
+            node = node.children[c];
+            ans += node.cnt;
+        }
+        return ans;
+    }
+}
+
+/**
+ * @param {string[]} words
+ * @return {number[]}
+ */
+var sumPrefixScores = function (words) {
+    const trie = new Trie();
+    for (const w of words) {
+        trie.insert(w);
+    }
+    return words.map(w => trie.search(w));
+};