Skip to content

feat: add js solution to lc problem: No.0410 #3212

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 2 commits into from
Jul 7, 2024
Merged

feat: add js solution to lc problem: No.0410 #3212

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
9075b0d
feat: update ts solution to lc problem: No.0410
rain84 Jul 6, 2024
dc2b35a
feat: add js solution to lc problem: No.0410
rain84 Jul 6, 2024
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
63 changes: 48 additions & 15 deletions solution/0400-0499/0410.Split Array Largest Sum/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -190,37 +190,70 @@ func splitArray(nums []int, k int) int {
}
```

#### JavaScript

```js
/**
* @param {number[]} nums
* @param {number} k
* @return {number}
*/
var splitArray = function (nums, k) {
let l = Math.max(...nums);
let r = nums.reduce((a, b) => a + b);

const check = mx => {
let [s, cnt] = [0, 0];
for (const x of nums) {
s += x;
if (s > mx) {
s = x;
if (++cnt === k) return false;
}
}
return true;
};

while (l < r) {
const mid = (l + r) >> 1;
if (check(mid)) {
r = mid;
} else {
l = mid + 1;
}
}
return l;
};
```

#### TypeScript

```ts
function splitArray(nums: number[], k: number): number {
let left = 0;
let right = 0;
for (const x of nums) {
left = Math.max(left, x);
right += x;
}
let l = Math.max(...nums);
let r = nums.reduce((a, b) => a + b);

const check = (mx: number) => {
let s = 1 << 30;
let cnt = 0;
let [s, cnt] = [0, 0];
for (const x of nums) {
s += x;
if (s > mx) {
s = x;
++cnt;
if (++cnt === k) return false;
}
}
return cnt <= k;
return true;
};
while (left < right) {
const mid = (left + right) >> 1;

while (l < r) {
const mid = (l + r) >> 1;
if (check(mid)) {
right = mid;
r = mid;
} else {
left = mid + 1;
l = mid + 1;
}
}
return left;
return l;
}
```

Expand Down
63 changes: 48 additions & 15 deletions solution/0400-0499/0410.Split Array Largest Sum/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -184,37 +184,70 @@ func splitArray(nums []int, k int) int {
}
```

#### JavaScript

```js
/**
* @param {number[]} nums
* @param {number} k
* @return {number}
*/
var splitArray = function (nums, k) {
let l = Math.max(...nums);
let r = nums.reduce((a, b) => a + b);

const check = mx => {
let [s, cnt] = [0, 0];
for (const x of nums) {
s += x;
if (s > mx) {
s = x;
if (++cnt === k) return false;
}
}
return true;
};

while (l < r) {
const mid = (l + r) >> 1;
if (check(mid)) {
r = mid;
} else {
l = mid + 1;
}
}
return l;
};
```

#### TypeScript

```ts
function splitArray(nums: number[], k: number): number {
let left = 0;
let right = 0;
for (const x of nums) {
left = Math.max(left, x);
right += x;
}
let l = Math.max(...nums);
let r = nums.reduce((a, b) => a + b);

const check = (mx: number) => {
let s = 1 << 30;
let cnt = 0;
let [s, cnt] = [0, 0];
for (const x of nums) {
s += x;
if (s > mx) {
s = x;
++cnt;
if (++cnt === k) return false;
}
}
return cnt <= k;
return true;
};
while (left < right) {
const mid = (left + right) >> 1;

while (l < r) {
const mid = (l + r) >> 1;
if (check(mid)) {
right = mid;
r = mid;
} else {
left = mid + 1;
l = mid + 1;
}
}
return left;
return l;
}
```

Expand Down
31 changes: 31 additions & 0 deletions solution/0400-0499/0410.Split Array Largest Sum/Solution.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,31 @@
/**
* @param {number[]} nums
* @param {number} k
* @return {number}
*/
var splitArray = function (nums, k) {
let l = Math.max(...nums);
let r = nums.reduce((a, b) => a + b);

const check = mx => {
let [s, cnt] = [0, 0];
for (const x of nums) {
s += x;
if (s > mx) {
s = x;
if (++cnt === k) return false;
}
}
return true;
};

while (l < r) {
const mid = (l + r) >> 1;
if (check(mid)) {
r = mid;
} else {
l = mid + 1;
}
}
return l;
};
27 changes: 12 additions & 15 deletions solution/0400-0499/0410.Split Array Largest Sum/Solution.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,29 +1,26 @@
function splitArray(nums: number[], k: number): number {
let left = 0;
let right = 0;
for (const x of nums) {
left = Math.max(left, x);
right += x;
}
let l = Math.max(...nums);
let r = nums.reduce((a, b) => a + b);

const check = (mx: number) => {
let s = 1 << 30;
let cnt = 0;
let [s, cnt] = [0, 0];
for (const x of nums) {
s += x;
if (s > mx) {
s = x;
++cnt;
if (++cnt === k) return false;
}
}
return cnt <= k;
return true;
};
while (left < right) {
const mid = (left + right) >> 1;

while (l < r) {
const mid = (l + r) >> 1;
if (check(mid)) {
right = mid;
r = mid;
} else {
left = mid + 1;
l = mid + 1;
}
}
return left;
return l;
}
Loading