feat: add solutions to lc problem: No.1156

No.1156.Swap For Longest Repeated Character Substring

Author: yanglbme

solution/1100-1199/1156.Swap For Longest Repeated Character Substring/README.md

@@ -192,6 +192,36 @@ func min(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maxRepOpt1(text: string): number {
+    const idx = (c: string) => c.charCodeAt(0) - 'a'.charCodeAt(0);
+    const cnt: number[] = new Array(26).fill(0);
+    for (const c of text) {
+        cnt[idx(c)]++;
+    }
+    let ans = 0;
+    let i = 0;
+    const n = text.length;
+    while (i < n) {
+        let j = i;
+        while (j < n && text[j] === text[i]) {
+            ++j;
+        }
+        const l = j - i;
+        let k = j + 1;
+        while (k < n && text[k] === text[i]) {
+            ++k;
+        }
+        const r = k - j - 1;
+        ans = Math.max(ans, Math.min(cnt[idx(text[i])], l + r + 1));
+        i = j;
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/1100-1199/1156.Swap For Longest Repeated Character Substring/README_EN.md

@@ -168,6 +168,36 @@ func min(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maxRepOpt1(text: string): number {
+    const idx = (c: string) => c.charCodeAt(0) - 'a'.charCodeAt(0);
+    const cnt: number[] = new Array(26).fill(0);
+    for (const c of text) {
+        cnt[idx(c)]++;
+    }
+    let ans = 0;
+    let i = 0;
+    const n = text.length;
+    while (i < n) {
+        let j = i;
+        while (j < n && text[j] === text[i]) {
+            ++j;
+        }
+        const l = j - i;
+        let k = j + 1;
+        while (k < n && text[k] === text[i]) {
+            ++k;
+        }
+        const r = k - j - 1;
+        ans = Math.max(ans, Math.min(cnt[idx(text[i])], l + r + 1));
+        i = j;
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/1100-1199/1156.Swap For Longest Repeated Character Substring/Solution.ts

@@ -0,0 +1,25 @@
+function maxRepOpt1(text: string): number {
+    const idx = (c: string) => c.charCodeAt(0) - 'a'.charCodeAt(0);
+    const cnt: number[] = new Array(26).fill(0);
+    for (const c of text) {
+        cnt[idx(c)]++;
+    }
+    let ans = 0;
+    let i = 0;
+    const n = text.length;
+    while (i < n) {
+        let j = i;
+        while (j < n && text[j] === text[i]) {
+            ++j;
+        }
+        const l = j - i;
+        let k = j + 1;
+        while (k < n && text[k] === text[i]) {
+            ++k;
+        }
+        const r = k - j - 1;
+        ans = Math.max(ans, Math.min(cnt[idx(text[i])], l + r + 1));
+        i = j;
+    }
+    return ans;
+}