Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 31646a1

Browse files
authored
feat: add solutions to lc problem: No.3254 (doocs#3766)
1 parent 8a5548b commit 31646a1

File tree

4 files changed

+118
-0
lines changed

4 files changed

+118
-0
lines changed

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

Lines changed: 46 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -204,4 +204,50 @@ function resultsArray(nums: number[], k: number): number[] {
204204

205205
<!-- solution:end -->
206206

207+
<!-- solution:start -->
208+
209+
### Solution 2
210+
211+
<!-- tabs:start -->
212+
213+
#### TypeScript
214+
215+
```ts
216+
export function resultsArray(nums: number[], k: number): number[] {
217+
const n = nums.length;
218+
const ans: number[] = [];
219+
220+
for (let i = 0, j = 0; i < n; i++) {
221+
if (i && nums[i - 1] + 1 !== nums[i]) j = i;
222+
if (i >= k - 1) {
223+
ans.push(i - k + 1 < j ? -1 : nums[i]);
224+
}
225+
}
226+
227+
return ans;
228+
}
229+
```
230+
231+
#### JavaScript
232+
233+
```js
234+
export function resultsArray(nums, k) {
235+
const n = nums.length;
236+
const ans = [];
237+
238+
for (let i = 0, j = 0; i < n; i++) {
239+
if (i && nums[i - 1] + 1 !== nums[i]) j = i;
240+
if (i >= k - 1) {
241+
ans.push(i - k + 1 < j ? -1 : nums[i]);
242+
}
243+
}
244+
245+
return ans;
246+
}
247+
```
248+
249+
<!-- tabs:end -->
250+
251+
<!-- solution:end -->
252+
207253
<!-- problem:end -->

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

Lines changed: 46 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -202,4 +202,50 @@ function resultsArray(nums: number[], k: number): number[] {
202202

203203
<!-- solution:end -->
204204

205+
<!-- solution:start -->
206+
207+
### Solution 2
208+
209+
<!-- tabs:start -->
210+
211+
#### TypeScript
212+
213+
```ts
214+
export function resultsArray(nums: number[], k: number): number[] {
215+
const n = nums.length;
216+
const ans: number[] = [];
217+
218+
for (let i = 0, j = 0; i < n; i++) {
219+
if (i && nums[i - 1] + 1 !== nums[i]) j = i;
220+
if (i >= k - 1) {
221+
ans.push(i - k + 1 < j ? -1 : nums[i]);
222+
}
223+
}
224+
225+
return ans;
226+
}
227+
```
228+
229+
#### JavaScript
230+
231+
```js
232+
export function resultsArray(nums, k) {
233+
const n = nums.length;
234+
const ans = [];
235+
236+
for (let i = 0, j = 0; i < n; i++) {
237+
if (i && nums[i - 1] + 1 !== nums[i]) j = i;
238+
if (i >= k - 1) {
239+
ans.push(i - k + 1 < j ? -1 : nums[i]);
240+
}
241+
}
242+
243+
return ans;
244+
}
245+
```
246+
247+
<!-- tabs:end -->
248+
249+
<!-- solution:end -->
250+
205251
<!-- problem:end -->
Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
export function resultsArray(nums, k) {
2+
const n = nums.length;
3+
const ans = [];
4+
5+
for (let i = 0, j = 0; i < n; i++) {
6+
if (i && nums[i - 1] + 1 !== nums[i]) j = i;
7+
if (i >= k - 1) {
8+
ans.push(i - k + 1 < j ? -1 : nums[i]);
9+
}
10+
}
11+
12+
return ans;
13+
}
Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
export function resultsArray(nums: number[], k: number): number[] {
2+
const n = nums.length;
3+
const ans: number[] = [];
4+
5+
for (let i = 0, j = 0; i < n; i++) {
6+
if (i && nums[i - 1] + 1 !== nums[i]) j = i;
7+
if (i >= k - 1) {
8+
ans.push(i - k + 1 < j ? -1 : nums[i]);
9+
}
10+
}
11+
12+
return ans;
13+
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /