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 771f8f3

Browse files
feat: add typescript solution to lc problem: No.2294
No.2294.Partition Array Such That Maximum Difference Is K
1 parent 942a0e5 commit 771f8f3

File tree

3 files changed

+36
-2
lines changed

3 files changed

+36
-2
lines changed

‎solution/2200-2299/2294.Partition Array Such That Maximum Difference Is K/README.md‎

Lines changed: 12 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -157,7 +157,18 @@ func partitionArray(nums []int, k int) int {
157157
### **TypeScript**
158158

159159
```ts
160-
160+
function partitionArray(nums: number[], k: number): number {
161+
if (!nums.length) return 0;
162+
nums.sort((a, b) => a - b);
163+
let ans = 1;
164+
let prev = nums[0] + k;
165+
for (let num of nums) {
166+
if (num <= prev) continue;
167+
prev = num + k;
168+
ans++;
169+
}
170+
return ans;
171+
};
161172
```
162173

163174
### **...**

‎solution/2200-2299/2294.Partition Array Such That Maximum Difference Is K/README_EN.md‎

Lines changed: 12 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -145,7 +145,18 @@ func partitionArray(nums []int, k int) int {
145145
### **TypeScript**
146146

147147
```ts
148-
148+
function partitionArray(nums: number[], k: number): number {
149+
if (!nums.length) return 0;
150+
nums.sort((a, b) => a - b);
151+
let ans = 1;
152+
let prev = nums[0] + k;
153+
for (let num of nums) {
154+
if (num <= prev) continue;
155+
prev = num + k;
156+
ans++;
157+
}
158+
return ans;
159+
};
149160
```
150161

151162
### **...**
Lines changed: 12 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
function partitionArray(nums: number[], k: number): number {
2+
if (!nums.length) return 0;
3+
nums.sort((a, b) => a - b);
4+
let ans = 1;
5+
let prev = nums[0] + k;
6+
for (let num of nums) {
7+
if (num <= prev) continue;
8+
prev = num + k;
9+
ans++;
10+
}
11+
return ans;
12+
};

0 commit comments

Comments
(0)

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