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

No.2274.Maximum Consecutive Floors Without Special Floors

Author: zhaocchen

solution/2200-2299/2274.Maximum Consecutive Floors Without Special Floors/README.md

@@ -85,7 +85,17 @@ class Solution {
 ### **TypeScript**
 
 ```ts
-
+function maxConsecutive(bottom: number, top: number, special: number[]): number {
+    let nums = special.slice().sort((a, b) => a - b);
+    nums.unshift(bottom - 1);
+    nums.push(top + 1);
+    let ans = 0;
+    const n = nums.length;
+    for (let i = 1; i < n; i++) {
+        ans = Math.max(ans, nums[i] - nums[i - 1] - 1);
+    }
+    return ans;
+};
 ```
 
 ### **...**

solution/2200-2299/2274.Maximum Consecutive Floors Without Special Floors/README_EN.md

@@ -75,7 +75,17 @@ class Solution {
 ### **TypeScript**
 
 ```ts
-
+function maxConsecutive(bottom: number, top: number, special: number[]): number {
+    let nums = special.slice().sort((a, b) => a - b);
+    nums.unshift(bottom - 1);
+    nums.push(top + 1);
+    let ans = 0;
+    const n = nums.length;
+    for (let i = 1; i < n; i++) {
+        ans = Math.max(ans, nums[i] - nums[i - 1] - 1);
+    }
+    return ans;
+};
 ```
 
 ### **...**

solution/2200-2299/2274.Maximum Consecutive Floors Without Special Floors/Solution.ts

@@ -0,0 +1,11 @@
+function maxConsecutive(bottom: number, top: number, special: number[]): number {
+    let nums = special.slice().sort((a, b) => a - b);
+    nums.unshift(bottom - 1);
+    nums.push(top + 1);
+    let ans = 0;
+    const n = nums.length;
+    for (let i = 1; i < n; i++) {
+        ans = Math.max(ans, nums[i] - nums[i - 1] - 1);
+    }
+    return ans;
+};