feat: add solutions to lc problem: No.3163 (#3715)

Author: rain84

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

@@ -213,4 +213,90 @@ function compressedString(word: string): string {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### 方法二：双指针
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function compressedString(word: string): string {
+    let res = '';
+
+    for (let i = 1, j = 0; i <= word.length; i++) {
+        if (word[i] !== word[j] || i - j === 9) {
+            res += i - j + word[j];
+            j = i;
+        }
+    }
+
+    return res;
+}
+```
+
+#### JavaScript
+
+```js
+function compressedString(word) {
+    let res = '';
+
+    for (let i = 1, j = 0; i <= word.length; i++) {
+        if (word[i] !== word[j] || i - j === 9) {
+            res += i - j + word[j];
+            j = i;
+        }
+    }
+
+    return res;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
+<!-- solution:start -->
+
+### 方法三：正则匹配
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function compressedString(word: string): string {
+    const regex = /(.)\1{0,8}/g;
+    let m: RegExpMatchArray | null = null;
+    let res = '';
+
+    while ((m = regex.exec(word))) {
+        res += m[0].length + m[1];
+    }
+
+    return res;
+}
+```
+
+#### JavaScript
+
+```js
+function compressedString(word) {
+    const regex = /(.)\1{0,8}/g;
+    let m = null;
+    let res = '';
+
+    while ((m = regex.exec(word))) {
+        res += m[0].length + m[1];
+    }
+
+    return res;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

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

@@ -209,4 +209,90 @@ function compressedString(word: string): string {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2: Two Pointers
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function compressedString(word: string): string {
+    let res = '';
+
+    for (let i = 1, j = 0; i <= word.length; i++) {
+        if (word[i] !== word[j] || i - j === 9) {
+            res += i - j + word[j];
+            j = i;
+        }
+    }
+
+    return res;
+}
+```
+
+#### JavaScript
+
+```js
+function compressedString(word) {
+    let res = '';
+
+    for (let i = 1, j = 0; i <= word.length; i++) {
+        if (word[i] !== word[j] || i - j === 9) {
+            res += i - j + word[j];
+            j = i;
+        }
+    }
+
+    return res;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
+<!-- solution:start -->
+
+### Solution 3: RegExp
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function compressedString(word: string): string {
+    const regex = /(.)\1{0,8}/g;
+    let m: RegExpMatchArray | null = null;
+    let res = '';
+
+    while ((m = regex.exec(word))) {
+        res += m[0].length + m[1];
+    }
+
+    return res;
+}
+```
+
+#### JavaScript
+
+```js
+function compressedString(word) {
+    const regex = /(.)\1{0,8}/g;
+    let m = null;
+    let res = '';
+
+    while ((m = regex.exec(word))) {
+        res += m[0].length + m[1];
+    }
+
+    return res;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

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

@@ -0,0 +1,12 @@
+function compressedString(word) {
+    let res = '';
+
+    for (let i = 1, j = 0; i <= word.length; i++) {
+        if (word[i] !== word[j] || i - j === 9) {
+            res += i - j + word[j];
+            j = i;
+        }
+    }
+
+    return res;
+}

solution/3100-3199/3163.String Compression III/Solution2.ts

@@ -0,0 +1,12 @@
+function compressedString(word: string): string {
+    let res = '';
+
+    for (let i = 1, j = 0; i <= word.length; i++) {
+        if (word[i] !== word[j] || i - j === 9) {
+            res += i - j + word[j];
+            j = i;
+        }
+    }
+
+    return res;
+}

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

@@ -0,0 +1,11 @@
+function compressedString(word) {
+    const regex = /(.)\1{0,8}/g;
+    let m = null;
+    let res = '';
+
+    while ((m = regex.exec(word))) {
+        res += m[0].length + m[1];
+    }
+
+    return res;
+}

solution/3100-3199/3163.String Compression III/Solution3.ts

@@ -0,0 +1,11 @@
+function compressedString(word: string): string {
+    const regex = /(.)\1{0,8}/g;
+    let m: RegExpMatchArray | null = null;
+    let res = '';
+
+    while ((m = regex.exec(word))) {
+        res += m[0].length + m[1];
+    }
+
+    return res;
+}