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 41ac4e1

Browse files
Create 2966.py
1 parent 976dc04 commit 41ac4e1

File tree

1 file changed

+17
-0
lines changed

1 file changed

+17
-0
lines changed

‎2501-3000/2966.py‎

Lines changed: 17 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
1+
class Solution:
2+
def divideArray(self, nums: List[int], k: int) -> List[List[int]]:
3+
n = len(nums)
4+
if n % 3 != 0:
5+
return []
6+
7+
nums.sort()
8+
9+
result = []
10+
group_index = 0
11+
for i in range(0, n, 3):
12+
if i + 2 < n and nums[i + 2] - nums[i] <= k:
13+
result.append([nums[i], nums[i + 1], nums[i + 2]])
14+
group_index += 1
15+
else:
16+
return []
17+
return result

0 commit comments

Comments
(0)

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