Skip to content

Create Solution.js #3994

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 3 commits into from
Apr 7, 2025
Merged

Create Solution.js #3994

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
bc23fa6
Create Solution.js
07subhadip Jan 25, 2025
78f639f
style: format code and docs with prettier
07subhadip Jan 25, 2025
9624a21
Refactor variable names and add JavaScript example.
yanglbme Apr 7, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
96 changes: 96 additions & 0 deletions ...n/3400-3499/3430.Maximum and Minimum Sums of at Most Size K Subarrays/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -185,6 +185,102 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3430.Ma

```

#### JavaScript

```js
/**
* @param {number[]} nums
* @param {number} k
* @return {number}
*/
var minMaxSubarraySum = function (nums, k) {
const computeSum = (nums, k, isMin) => {
const n = nums.length;
const prev = Array(n).fill(-1);
const next = Array(n).fill(n);
let stk = [];

if (isMin) {
for (let i = 0; i < n; i++) {
while (stk.length > 0 && nums[stk[stk.length - 1]] >= nums[i]) {
stk.pop();
}
prev[i] = stk.length > 0 ? stk[stk.length - 1] : -1;
stk.push(i);
}
stk = [];
for (let i = n - 1; i >= 0; i--) {
while (stk.length > 0 && nums[stk[stk.length - 1]] > nums[i]) {
stk.pop();
}
next[i] = stk.length > 0 ? stk[stk.length - 1] : n;
stk.push(i);
}
} else {
for (let i = 0; i < n; i++) {
while (stk.length > 0 && nums[stk[stk.length - 1]] <= nums[i]) {
stk.pop();
}
prev[i] = stk.length > 0 ? stk[stk.length - 1] : -1;
stk.push(i);
}
stk = [];
for (let i = n - 1; i >= 0; i--) {
while (stk.length > 0 && nums[stk[stk.length - 1]] < nums[i]) {
stk.pop();
}
next[i] = stk.length > 0 ? stk[stk.length - 1] : n;
stk.push(i);
}
}

let totalSum = 0;
for (let i = 0; i < n; i++) {
const left = prev[i];
const right = next[i];
const a = left + 1;
const b = i;
const c = i;
const d = right - 1;

let start1 = Math.max(a, i - k + 1);
let endCandidate1 = d - k + 1;
let upper1 = Math.min(b, endCandidate1);

let sum1 = 0;
if (upper1 >= start1) {
const termCount = upper1 - start1 + 1;
const first = start1;
const last = upper1;
const indexSum = (last * (last + 1)) / 2 - ((first - 1) * first) / 2;
const constantSum = (k - i) * termCount;
sum1 = indexSum + constantSum;
}

let start2 = upper1 + 1;
let end2 = b;
start2 = Math.max(start2, a);
end2 = Math.min(end2, b);

let sum2 = 0;
if (start2 <= end2) {
const count = end2 - start2 + 1;
const term = d - i + 1;
sum2 = term * count;
}

totalSum += nums[i] * (sum1 + sum2);
}

return totalSum;
};

const minSum = computeSum(nums, k, true);
const maxSum = computeSum(nums, k, false);
return minSum + maxSum;
};
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
96 changes: 96 additions & 0 deletions ...400-3499/3430.Maximum and Minimum Sums of at Most Size K Subarrays/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -182,6 +182,102 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3430.Ma

```

#### JavaScript

```js
/**
* @param {number[]} nums
* @param {number} k
* @return {number}
*/
var minMaxSubarraySum = function (nums, k) {
const computeSum = (nums, k, isMin) => {
const n = nums.length;
const prev = Array(n).fill(-1);
const next = Array(n).fill(n);
let stk = [];

if (isMin) {
for (let i = 0; i < n; i++) {
while (stk.length > 0 && nums[stk[stk.length - 1]] >= nums[i]) {
stk.pop();
}
prev[i] = stk.length > 0 ? stk[stk.length - 1] : -1;
stk.push(i);
}
stk = [];
for (let i = n - 1; i >= 0; i--) {
while (stk.length > 0 && nums[stk[stk.length - 1]] > nums[i]) {
stk.pop();
}
next[i] = stk.length > 0 ? stk[stk.length - 1] : n;
stk.push(i);
}
} else {
for (let i = 0; i < n; i++) {
while (stk.length > 0 && nums[stk[stk.length - 1]] <= nums[i]) {
stk.pop();
}
prev[i] = stk.length > 0 ? stk[stk.length - 1] : -1;
stk.push(i);
}
stk = [];
for (let i = n - 1; i >= 0; i--) {
while (stk.length > 0 && nums[stk[stk.length - 1]] < nums[i]) {
stk.pop();
}
next[i] = stk.length > 0 ? stk[stk.length - 1] : n;
stk.push(i);
}
}

let totalSum = 0;
for (let i = 0; i < n; i++) {
const left = prev[i];
const right = next[i];
const a = left + 1;
const b = i;
const c = i;
const d = right - 1;

let start1 = Math.max(a, i - k + 1);
let endCandidate1 = d - k + 1;
let upper1 = Math.min(b, endCandidate1);

let sum1 = 0;
if (upper1 >= start1) {
const termCount = upper1 - start1 + 1;
const first = start1;
const last = upper1;
const indexSum = (last * (last + 1)) / 2 - ((first - 1) * first) / 2;
const constantSum = (k - i) * termCount;
sum1 = indexSum + constantSum;
}

let start2 = upper1 + 1;
let end2 = b;
start2 = Math.max(start2, a);
end2 = Math.min(end2, b);

let sum2 = 0;
if (start2 <= end2) {
const count = end2 - start2 + 1;
const term = d - i + 1;
sum2 = term * count;
}

totalSum += nums[i] * (sum1 + sum2);
}

return totalSum;
};

const minSum = computeSum(nums, k, true);
const maxSum = computeSum(nums, k, false);
return minSum + maxSum;
};
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
91 changes: 91 additions & 0 deletions solution/3400-3499/3430.Maximum and Minimum Sums of at Most Size K Subarrays/Solution.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,91 @@
/**
* @param {number[]} nums
* @param {number} k
* @return {number}
*/
var minMaxSubarraySum = function (nums, k) {
const computeSum = (nums, k, isMin) => {
const n = nums.length;
const prev = Array(n).fill(-1);
const next = Array(n).fill(n);
let stk = [];

if (isMin) {
for (let i = 0; i < n; i++) {
while (stk.length > 0 && nums[stk[stk.length - 1]] >= nums[i]) {
stk.pop();
}
prev[i] = stk.length > 0 ? stk[stk.length - 1] : -1;
stk.push(i);
}
stk = [];
for (let i = n - 1; i >= 0; i--) {
while (stk.length > 0 && nums[stk[stk.length - 1]] > nums[i]) {
stk.pop();
}
next[i] = stk.length > 0 ? stk[stk.length - 1] : n;
stk.push(i);
}
} else {
for (let i = 0; i < n; i++) {
while (stk.length > 0 && nums[stk[stk.length - 1]] <= nums[i]) {
stk.pop();
}
prev[i] = stk.length > 0 ? stk[stk.length - 1] : -1;
stk.push(i);
}
stk = [];
for (let i = n - 1; i >= 0; i--) {
while (stk.length > 0 && nums[stk[stk.length - 1]] < nums[i]) {
stk.pop();
}
next[i] = stk.length > 0 ? stk[stk.length - 1] : n;
stk.push(i);
}
}

let totalSum = 0;
for (let i = 0; i < n; i++) {
const left = prev[i];
const right = next[i];
const a = left + 1;
const b = i;
const c = i;
const d = right - 1;

let start1 = Math.max(a, i - k + 1);
let endCandidate1 = d - k + 1;
let upper1 = Math.min(b, endCandidate1);

let sum1 = 0;
if (upper1 >= start1) {
const termCount = upper1 - start1 + 1;
const first = start1;
const last = upper1;
const indexSum = (last * (last + 1)) / 2 - ((first - 1) * first) / 2;
const constantSum = (k - i) * termCount;
sum1 = indexSum + constantSum;
}

let start2 = upper1 + 1;
let end2 = b;
start2 = Math.max(start2, a);
end2 = Math.min(end2, b);

let sum2 = 0;
if (start2 <= end2) {
const count = end2 - start2 + 1;
const term = d - i + 1;
sum2 = term * count;
}

totalSum += nums[i] * (sum1 + sum2);
}

return totalSum;
};

const minSum = computeSum(nums, k, true);
const maxSum = computeSum(nums, k, false);
return minSum + maxSum;
};