chore: update

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/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 -->