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

feat: add solutions to lc problems: No.2945~2947 #2024

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.

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
acbin merged 1 commit into main from dev
Nov 27, 2023
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
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
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -66,27 +66,123 @@
<!-- 这里可写当前语言的特殊实现逻辑 -->

```python

class Solution:
def findMaximumLength(self, nums: List[int]) -> int:
n = len(nums)
s = list(accumulate(nums, initial=0))
f = [0] * (n + 1)
pre = [0] * (n + 2)
for i in range(1, n + 1):
pre[i] = max(pre[i], pre[i - 1])
f[i] = f[pre[i]] + 1
j = bisect_left(s, s[i] * 2 - s[pre[i]])
pre[j] = i
return f[n]
```

### **Java**

<!-- 这里可写当前语言的特殊实现逻辑 -->

```java

class Solution {
public int findMaximumLength(int[] nums) {
int n = nums.length;
long[] s = new long[n + 1];
for (int i = 0; i < n; ++i) {
s[i + 1] = s[i] + nums[i];
}
int[] f = new int[n + 1];
int[] pre = new int[n + 2];
for (int i = 1; i <= n; ++i) {
pre[i] = Math.max(pre[i], pre[i - 1]);
f[i] = f[pre[i]] + 1;
int j = Arrays.binarySearch(s, s[i] * 2 - s[pre[i]]);
pre[j < 0 ? -j - 1 : j] = i;
}
return f[n];
}
}
```

### **C++**

```cpp

class Solution {
public:
int findMaximumLength(vector<int>& nums) {
int n = nums.size();
int f[n + 1];
int pre[n + 2];
long long s[n + 1];
for (int i = 0; i < n; ++i) {
s[i + 1] = s[i] + nums[i];
}
memset(f, 0, sizeof(f));
memset(pre, 0, sizeof(pre));
for (int i = 1; i <= n; ++i) {
pre[i] = max(pre[i], pre[i - 1]);
f[i] = f[pre[i]] + 1;
int j = lower_bound(s, s + n + 1, s[i] * 2 - s[pre[i]]) - s;
pre[j] = i;
}
return f[n];
}
};
```

### **Go**

```go
func findMaximumLength(nums []int) int {
n := len(nums)
f := make([]int, n+1)
pre := make([]int, n+2)
s := make([]int, n+1)
for i, x := range nums {
s[i+1] = s[i] + x
}
for i := 1; i <= n; i++ {
pre[i] = max(pre[i], pre[i-1])
f[i] = f[pre[i]] + 1
j := sort.SearchInts(s, s[i]*2-s[pre[i]])
pre[j] = max(pre[j], i)
}
return f[n]
}
```

### **TypeScript**

```ts
function findMaximumLength(nums: number[]): number {
const n = nums.length;
const f: number[] = Array(n + 1).fill(0);
const pre: number[] = Array(n + 2).fill(0);
const s: number[] = Array(n + 1).fill(0);
for (let i = 1; i <= n; ++i) {
s[i] = s[i - 1] + nums[i - 1];
}
const search = (nums: number[], x: number): number => {
let [l, r] = [0, nums.length];
while (l < r) {
const mid = (l + r) >> 1;
if (nums[mid] >= x) {
r = mid;
} else {
l = mid + 1;
}
}
return l;
};
for (let i = 1; i <= n; ++i) {
pre[i] = Math.max(pre[i], pre[i - 1]);
f[i] = f[pre[i]] + 1;
const j = search(s, s[i] * 2 - s[pre[i]]);
pre[j] = i;
}
return f[n];
}
```

### **...**
Expand Down
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -58,25 +58,121 @@ Because the given array is not non-decreasing, the maximum<!-- notionvc: 3447a50
### **Python3**

```python

class Solution:
def findMaximumLength(self, nums: List[int]) -> int:
n = len(nums)
s = list(accumulate(nums, initial=0))
f = [0] * (n + 1)
pre = [0] * (n + 2)
for i in range(1, n + 1):
pre[i] = max(pre[i], pre[i - 1])
f[i] = f[pre[i]] + 1
j = bisect_left(s, s[i] * 2 - s[pre[i]])
pre[j] = i
return f[n]
```

### **Java**

```java

class Solution {
public int findMaximumLength(int[] nums) {
int n = nums.length;
long[] s = new long[n + 1];
for (int i = 0; i < n; ++i) {
s[i + 1] = s[i] + nums[i];
}
int[] f = new int[n + 1];
int[] pre = new int[n + 2];
for (int i = 1; i <= n; ++i) {
pre[i] = Math.max(pre[i], pre[i - 1]);
f[i] = f[pre[i]] + 1;
int j = Arrays.binarySearch(s, s[i] * 2 - s[pre[i]]);
pre[j < 0 ? -j - 1 : j] = i;
}
return f[n];
}
}
```

### **C++**

```cpp

class Solution {
public:
int findMaximumLength(vector<int>& nums) {
int n = nums.size();
int f[n + 1];
int pre[n + 2];
long long s[n + 1];
for (int i = 0; i < n; ++i) {
s[i + 1] = s[i] + nums[i];
}
memset(f, 0, sizeof(f));
memset(pre, 0, sizeof(pre));
for (int i = 1; i <= n; ++i) {
pre[i] = max(pre[i], pre[i - 1]);
f[i] = f[pre[i]] + 1;
int j = lower_bound(s, s + n + 1, s[i] * 2 - s[pre[i]]) - s;
pre[j] = i;
}
return f[n];
}
};
```

### **Go**

```go
func findMaximumLength(nums []int) int {
n := len(nums)
f := make([]int, n+1)
pre := make([]int, n+2)
s := make([]int, n+1)
for i, x := range nums {
s[i+1] = s[i] + x
}
for i := 1; i <= n; i++ {
pre[i] = max(pre[i], pre[i-1])
f[i] = f[pre[i]] + 1
j := sort.SearchInts(s, s[i]*2-s[pre[i]])
pre[j] = max(pre[j], i)
}
return f[n]
}
```

### **TypeScript**

```ts
function findMaximumLength(nums: number[]): number {
const n = nums.length;
const f: number[] = Array(n + 1).fill(0);
const pre: number[] = Array(n + 2).fill(0);
const s: number[] = Array(n + 1).fill(0);
for (let i = 1; i <= n; ++i) {
s[i] = s[i - 1] + nums[i - 1];
}
const search = (nums: number[], x: number): number => {
let [l, r] = [0, nums.length];
while (l < r) {
const mid = (l + r) >> 1;
if (nums[mid] >= x) {
r = mid;
} else {
l = mid + 1;
}
}
return l;
};
for (let i = 1; i <= n; ++i) {
pre[i] = Math.max(pre[i], pre[i - 1]);
f[i] = f[pre[i]] + 1;
const j = search(s, s[i] * 2 - s[pre[i]]);
pre[j] = i;
}
return f[n];
}
```

### **...**
Expand Down
View file Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
class Solution {
public:
int findMaximumLength(vector<int>& nums) {
int n = nums.size();
int f[n + 1];
int pre[n + 2];
long long s[n + 1];
for (int i = 0; i < n; ++i) {
s[i + 1] = s[i] + nums[i];
}
memset(f, 0, sizeof(f));
memset(pre, 0, sizeof(pre));
for (int i = 1; i <= n; ++i) {
pre[i] = max(pre[i], pre[i - 1]);
f[i] = f[pre[i]] + 1;
int j = lower_bound(s, s + n + 1, s[i] * 2 - s[pre[i]]) - s;
pre[j] = i;
}
return f[n];
}
};
View file Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
func findMaximumLength(nums []int) int {
n := len(nums)
f := make([]int, n+1)
pre := make([]int, n+2)
s := make([]int, n+1)
for i, x := range nums {
s[i+1] = s[i] + x
}
for i := 1; i <= n; i++ {
pre[i] = max(pre[i], pre[i-1])
f[i] = f[pre[i]] + 1
j := sort.SearchInts(s, s[i]*2-s[pre[i]])
pre[j] = max(pre[j], i)
}
return f[n]
}
View file Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,18 @@
class Solution {
public int findMaximumLength(int[] nums) {
int n = nums.length;
long[] s = new long[n + 1];
for (int i = 0; i < n; ++i) {
s[i + 1] = s[i] + nums[i];
}
int[] f = new int[n + 1];
int[] pre = new int[n + 2];
for (int i = 1; i <= n; ++i) {
pre[i] = Math.max(pre[i], pre[i - 1]);
f[i] = f[pre[i]] + 1;
int j = Arrays.binarySearch(s, s[i] * 2 - s[pre[i]]);
pre[j < 0 ? -j - 1 : j] = i;
}
return f[n];
}
}
View file Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,12 @@
class Solution:
def findMaximumLength(self, nums: List[int]) -> int:
n = len(nums)
s = list(accumulate(nums, initial=0))
f = [0] * (n + 1)
pre = [0] * (n + 2)
for i in range(1, n + 1):
pre[i] = max(pre[i], pre[i - 1])
f[i] = f[pre[i]] + 1
j = bisect_left(s, s[i] * 2 - s[pre[i]])
pre[j] = i
return f[n]
View file Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,28 @@
function findMaximumLength(nums: number[]): number {
const n = nums.length;
const f: number[] = Array(n + 1).fill(0);
const pre: number[] = Array(n + 2).fill(0);
const s: number[] = Array(n + 1).fill(0);
for (let i = 1; i <= n; ++i) {
s[i] = s[i - 1] + nums[i - 1];
}
const search = (nums: number[], x: number): number => {
let [l, r] = [0, nums.length];
while (l < r) {
const mid = (l + r) >> 1;
if (nums[mid] >= x) {
r = mid;
} else {
l = mid + 1;
}
}
return l;
};
for (let i = 1; i <= n; ++i) {
pre[i] = Math.max(pre[i], pre[i - 1]);
f[i] = f[pre[i]] + 1;
const j = search(s, s[i] * 2 - s[pre[i]]);
pre[j] = i;
}
return f[n];
}
Loading

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