feat: update lc problems (doocs#3718)

Author: yanglbme

solution/0200-0299/0219.Contains Duplicate II/README.md

@@ -148,6 +148,26 @@ function containsNearbyDuplicate(nums: number[], k: number): boolean {
 }
 ```
 
+#### JavaScript
+
+```js
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {boolean}
+ */
+var containsNearbyDuplicate = function (nums, k) {
+    const d = new Map();
+    for (let i = 0; i < nums.length; ++i) {
+        if (d.has(nums[i]) && i - d.get(nums[i]) <= k) {
+            return true;
+        }
+        d.set(nums[i], i);
+    }
+    return false;
+};
+```
+
 #### C#
 
 ```cs

solution/0200-0299/0219.Contains Duplicate II/README_EN.md

@@ -147,6 +147,26 @@ function containsNearbyDuplicate(nums: number[], k: number): boolean {
 }
 ```
 
+#### JavaScript
+
+```js
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {boolean}
+ */
+var containsNearbyDuplicate = function (nums, k) {
+    const d = new Map();
+    for (let i = 0; i < nums.length; ++i) {
+        if (d.has(nums[i]) && i - d.get(nums[i]) <= k) {
+            return true;
+        }
+        d.set(nums[i], i);
+    }
+    return false;
+};
+```
+
 #### C#
 
 ```cs

solution/0200-0299/0219.Contains Duplicate II/Solution.js

@@ -3,7 +3,7 @@
  * @param {number} k
  * @return {boolean}
  */
-var containsNearbyDuplicate = function(nums, k) {
+var containsNearbyDuplicate = function (nums, k) {
     const d = new Map();
     for (let i = 0; i < nums.length; ++i) {
         if (d.has(nums[i]) && i - d.get(nums[i]) <= k) {

solution/2500-2599/2524.Maximum Frequency Score of a Subarray/README.md

@@ -3,6 +3,7 @@ comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/2500-2599/2524.Maximum%20Frequency%20Score%20of%20a%20Subarray/README.md
 tags:
+    - 栈
     - 数组
     - 哈希表
     - 数学

solution/2500-2599/2524.Maximum Frequency Score of a Subarray/README_EN.md

@@ -3,6 +3,7 @@ comments: true
 difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/2500-2599/2524.Maximum%20Frequency%20Score%20of%20a%20Subarray/README_EN.md
 tags:
+    - Stack
     - Array
     - Hash Table
     - Math

solution/2600-2699/2685.Count the Number of Complete Components/README.md

@@ -7,6 +7,7 @@ source: 第 345 场周赛 Q4
 tags:
     - 深度优先搜索
     - 广度优先搜索
+    - 并查集
     - 图
 ---
 

solution/2600-2699/2685.Count the Number of Complete Components/README_EN.md

@@ -7,6 +7,7 @@ source: Weekly Contest 345 Q4
 tags:
     - Depth-First Search
     - Breadth-First Search
+    - Union Find
     - Graph
 ---
 

solution/3100-3199/3163.String Compression III/README.md

@@ -209,6 +209,33 @@ function compressedString(word: string): string {
 }
 ```
 
+#### JavaScript
+
+```js
+/**
+ * @param {string} word
+ * @return {string}
+ */
+var compressedString = function (word) {
+    const ans = [];
+    const n = word.length;
+    for (let i = 0; i < n; ) {
+        let j = i + 1;
+        while (j < n && word[j] === word[i]) {
+            ++j;
+        }
+        let k = j - i;
+        while (k) {
+            const x = Math.min(k, 9);
+            ans.push(x + word[i]);
+            k -= x;
+        }
+        i = j;
+    }
+    return ans.join('');
+};
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3100-3199/3163.String Compression III/README_EN.md

@@ -205,6 +205,33 @@ function compressedString(word: string): string {
 }
 ```
 
+#### JavaScript
+
+```js
+/**
+ * @param {string} word
+ * @return {string}
+ */
+var compressedString = function (word) {
+    const ans = [];
+    const n = word.length;
+    for (let i = 0; i < n; ) {
+        let j = i + 1;
+        while (j < n && word[j] === word[i]) {
+            ++j;
+        }
+        let k = j - i;
+        while (k) {
+            const x = Math.min(k, 9);
+            ans.push(x + word[i]);
+            k -= x;
+        }
+        i = j;
+    }
+    return ans.join('');
+};
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3100-3199/3163.String Compression III/Solution.js

@@ -2,10 +2,10 @@
  * @param {string} word
  * @return {string}
  */
-var compressedString = function(word) {
+var compressedString = function (word) {
     const ans = [];
     const n = word.length;
-    for (let i = 0; i < n;) {
+    for (let i = 0; i < n; ) {
         let j = i + 1;
         while (j < n && word[j] === word[i]) {
             ++j;