feat: add typescript solution to lc problem: No.1313.Decompress Run-Length Encoded List

Author: zhaocchen

solution/1300-1399/1313.Decompress Run-Length Encoded List/README.md

@@ -82,6 +82,20 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function decompressRLElist(nums: number[]): number[] {
+    let n = nums.length >> 1;
+    let ans = [];
+    for (let i = 0; i < n; i++) {
+        let freq = nums[2 * i], val = nums[2 * i + 1];
+        ans.push(...new Array(freq).fill(val));
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/1300-1399/1313.Decompress Run-Length Encoded List/README_EN.md

@@ -73,6 +73,20 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function decompressRLElist(nums: number[]): number[] {
+    let n = nums.length >> 1;
+    let ans = [];
+    for (let i = 0; i < n; i++) {
+        let freq = nums[2 * i], val = nums[2 * i + 1];
+        ans.push(...new Array(freq).fill(val));
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/1300-1399/1313.Decompress Run-Length Encoded List/Solution.ts

@@ -0,0 +1,9 @@
+function decompressRLElist(nums: number[]): number[] {
+    let n = nums.length >> 1;
+    let ans = [];
+    for (let i = 0; i < n; i++) {
+        let freq = nums[2 * i], val = nums[2 * i + 1];
+        ans.push(...new Array(freq).fill(val));
+    }
+    return ans;
+};