feat: add typescript solution to lc problem: No.0394

No.0394.Decode String

Author: zhaocchen

solution/0300-0399/0394.Decode String/README.md

@@ -114,6 +114,33 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function decodeString(s: string): string {
+    let ans = '';
+    let stack = [];
+    let count = 0; // repeatCount
+    for (let cur of s) {
+        if ((/[0-9]/.test(cur))) {
+            count = count * 10 + Number(cur);
+        } else if (/[a-z]/.test(cur)) {
+            ans += cur;
+        } else if ('[' == cur) {
+            stack.push([ans, count]);
+            // reset
+            ans = '';
+            count = 0;
+        } else {
+            // match ']'
+            let [pre, count] = stack.pop();
+            ans = pre + ans.repeat(count);
+        }
+    }
+    return ans;
+};
+```
+
 ### **...**
 
 ```

solution/0300-0399/0394.Decode String/README_EN.md

@@ -94,6 +94,33 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function decodeString(s: string): string {
+    let ans = '';
+    let stack = [];
+    let count = 0; // repeatCount
+    for (let cur of s) {
+        if ((/[0-9]/.test(cur))) {
+            count = count * 10 + Number(cur);
+        } else if (/[a-z]/.test(cur)) {
+            ans += cur;
+        } else if ('[' == cur) {
+            stack.push([ans, count]);
+            // reset
+            ans = '';
+            count = 0;
+        } else {
+            // match ']'
+            let [pre, count] = stack.pop();
+            ans = pre + ans.repeat(count);
+        }
+    }
+    return ans;
+};
+```
+
 ### **...**
 
 ```

solution/0300-0399/0394.Decode String/Solution.ts

@@ -0,0 +1,22 @@
+function decodeString(s: string): string {
+    let ans = '';
+    let stack = [];
+    let count = 0; // repeatCount
+    for (let cur of s) {
+        if ((/[0-9]/.test(cur))) {
+            count = count * 10 + Number(cur);
+        } else if (/[a-z]/.test(cur)) {
+            ans += cur;
+        } else if ('[' == cur) {
+            stack.push([ans, count]);
+            // reset
+            ans = '';
+            count = 0;
+        } else {
+            // match ']'
+            let [pre, count] = stack.pop();
+            ans = pre + ans.repeat(count);
+        }
+    }
+    return ans;
+};