feat: add solutions to lcci problem: No.17.05 (#923)

No.17.05.Find Longest Subarray

Author: thinkasany

lcci/17.05.Find Longest Subarray/README.md

@@ -149,6 +149,31 @@ func findLongestSubarray(array []string) []string {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function findLongestSubarray(array: string[]): string[] {
+    const vis = new Map();
+    vis.set(0, -1);
+    let s = 0,
+        mx = 0,
+        k = 0;
+    for (let i = 0; i < array.length; ++i) {
+        s += array[i] >= 'A' ? 1 : -1;
+        if (vis.has(s)) {
+            const j = vis.get(s);
+            if (mx < i - j) {
+                mx = i - j;
+                k = j + 1;
+            }
+        } else {
+            vis.set(s, i);
+        }
+    }
+    return array.slice(k, k + mx);
+}
+```
+
 ### **...**
 
 ```

lcci/17.05.Find Longest Subarray/README_EN.md

@@ -137,6 +137,31 @@ func findLongestSubarray(array []string) []string {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function findLongestSubarray(array: string[]): string[] {
+    const vis = new Map();
+    vis.set(0, -1);
+    let s = 0,
+        mx = 0,
+        k = 0;
+    for (let i = 0; i < array.length; ++i) {
+        s += array[i] >= 'A' ? 1 : -1;
+        if (vis.has(s)) {
+            const j = vis.get(s);
+            if (mx < i - j) {
+                mx = i - j;
+                k = j + 1;
+            }
+        } else {
+            vis.set(s, i);
+        }
+    }
+    return array.slice(k, k + mx);
+}
+```
+
 ### **...**
 
 ```

lcci/17.05.Find Longest Subarray/Solution.ts

@@ -0,0 +1,20 @@
+function findLongestSubarray(array: string[]): string[] {
+    const vis = new Map();
+    vis.set(0, -1);
+    let s = 0,
+        mx = 0,
+        k = 0;
+    for (let i = 0; i < array.length; ++i) {
+        s += array[i] >= 'A' ? 1 : -1;
+        if (vis.has(s)) {
+            const j = vis.get(s);
+            if (mx < i - j) {
+                mx = i - j;
+                k = j + 1;
+            }
+        } else {
+            vis.set(s, i);
+        }
+    }
+    return array.slice(k, k + mx);
+}