feat: add solutions to lc problem: No.3254 (#3766)

Author: rain84

solution/3200-3299/3254.Find the Power of K-Size Subarrays I/README.md

@@ -204,4 +204,50 @@ function resultsArray(nums: number[], k: number): number[] {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+export function resultsArray(nums: number[], k: number): number[] {
+    const n = nums.length;
+    const ans: number[] = [];
+
+    for (let i = 0, j = 0; i < n; i++) {
+        if (i && nums[i - 1] + 1 !== nums[i]) j = i;
+        if (i >= k - 1) {
+            ans.push(i - k + 1 < j ? -1 : nums[i]);
+        }
+    }
+
+    return ans;
+}
+```
+
+#### JavaScript
+
+```js
+export function resultsArray(nums, k) {
+    const n = nums.length;
+    const ans = [];
+
+    for (let i = 0, j = 0; i < n; i++) {
+        if (i && nums[i - 1] + 1 !== nums[i]) j = i;
+        if (i >= k - 1) {
+            ans.push(i - k + 1 < j ? -1 : nums[i]);
+        }
+    }
+
+    return ans;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/3200-3299/3254.Find the Power of K-Size Subarrays I/README_EN.md

@@ -202,4 +202,50 @@ function resultsArray(nums: number[], k: number): number[] {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+export function resultsArray(nums: number[], k: number): number[] {
+    const n = nums.length;
+    const ans: number[] = [];
+
+    for (let i = 0, j = 0; i < n; i++) {
+        if (i && nums[i - 1] + 1 !== nums[i]) j = i;
+        if (i >= k - 1) {
+            ans.push(i - k + 1 < j ? -1 : nums[i]);
+        }
+    }
+
+    return ans;
+}
+```
+
+#### JavaScript
+
+```js
+export function resultsArray(nums, k) {
+    const n = nums.length;
+    const ans = [];
+
+    for (let i = 0, j = 0; i < n; i++) {
+        if (i && nums[i - 1] + 1 !== nums[i]) j = i;
+        if (i >= k - 1) {
+            ans.push(i - k + 1 < j ? -1 : nums[i]);
+        }
+    }
+
+    return ans;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/3200-3299/3254.Find the Power of K-Size Subarrays I/Solution2.js

@@ -0,0 +1,13 @@
+export function resultsArray(nums, k) {
+    const n = nums.length;
+    const ans = [];
+
+    for (let i = 0, j = 0; i < n; i++) {
+        if (i && nums[i - 1] + 1 !== nums[i]) j = i;
+        if (i >= k - 1) {
+            ans.push(i - k + 1 < j ? -1 : nums[i]);
+        }
+    }
+
+    return ans;
+}

solution/3200-3299/3254.Find the Power of K-Size Subarrays I/Solution2.ts

@@ -0,0 +1,13 @@
+export function resultsArray(nums: number[], k: number): number[] {
+    const n = nums.length;
+    const ans: number[] = [];
+
+    for (let i = 0, j = 0; i < n; i++) {
+        if (i && nums[i - 1] + 1 !== nums[i]) j = i;
+        if (i >= k - 1) {
+            ans.push(i - k + 1 < j ? -1 : nums[i]);
+        }
+    }
+
+    return ans;
+}