Skip to content

feat: add solutions to lc problems: No.3573,3574 #4908

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
yanglbme merged 1 commit into from
Dec 16, 2025
+227 −0
Merged

feat: add solutions to lc problems: No.3573,3574 #4908

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
38 changes: 38 additions & 0 deletions solution/3500-3599/3573.Best Time to Buy and Sell Stock V/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -282,6 +282,44 @@ impl Solution {
}
```

#### C#

```cs
public class Solution {
public long MaximumProfit(int[] prices, int k) {
int n = prices.Length;
long[,,] f = new long[n, k + 1, 3];

for (int j = 1; j <= k; ++j) {
f[0, j, 1] = -prices[0];
f[0, j, 2] = prices[0];
}

for (int i = 1; i < n; ++i) {
for (int j = 1; j <= k; ++j) {
f[i, j, 0] = Math.Max(
f[i - 1, j, 0],
Math.Max(
f[i - 1, j, 1] + prices[i],
f[i - 1, j, 2] - prices[i]
)
);
f[i, j, 1] = Math.Max(
f[i - 1, j, 1],
f[i - 1, j - 1, 0] - prices[i]
);
f[i, j, 2] = Math.Max(
f[i - 1, j, 2],
f[i - 1, j - 1, 0] + prices[i]
);
}
}

return f[n - 1, k, 0];
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
38 changes: 38 additions & 0 deletions solution/3500-3599/3573.Best Time to Buy and Sell Stock V/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -280,6 +280,44 @@ impl Solution {
}
```

#### C#

```cs
public class Solution {
public long MaximumProfit(int[] prices, int k) {
int n = prices.Length;
long[,,] f = new long[n, k + 1, 3];

for (int j = 1; j <= k; ++j) {
f[0, j, 1] = -prices[0];
f[0, j, 2] = prices[0];
}

for (int i = 1; i < n; ++i) {
for (int j = 1; j <= k; ++j) {
f[i, j, 0] = Math.Max(
f[i - 1, j, 0],
Math.Max(
f[i - 1, j, 1] + prices[i],
f[i - 1, j, 2] - prices[i]
)
);
f[i, j, 1] = Math.Max(
f[i - 1, j, 1],
f[i - 1, j - 1, 0] - prices[i]
);
f[i, j, 2] = Math.Max(
f[i - 1, j, 2],
f[i - 1, j - 1, 0] + prices[i]
);
}
}

return f[n - 1, k, 0];
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
33 changes: 33 additions & 0 deletions solution/3500-3599/3573.Best Time to Buy and Sell Stock V/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,33 @@
public class Solution {
public long MaximumProfit(int[] prices, int k) {
int n = prices.Length;
long[,,] f = new long[n, k + 1, 3];

for (int j = 1; j <= k; ++j) {
f[0, j, 1] = -prices[0];
f[0, j, 2] = prices[0];
}

for (int i = 1; i < n; ++i) {
for (int j = 1; j <= k; ++j) {
f[i, j, 0] = Math.Max(
f[i - 1, j, 0],
Math.Max(
f[i - 1, j, 1] + prices[i],
f[i - 1, j, 2] - prices[i]
)
);
f[i, j, 1] = Math.Max(
f[i - 1, j, 1],
f[i - 1, j - 1, 0] - prices[i]
);
f[i, j, 2] = Math.Max(
f[i - 1, j, 2],
f[i - 1, j - 1, 0] + prices[i]
);
}
}

return f[n - 1, k, 0];
}
}
41 changes: 41 additions & 0 deletions solution/3500-3599/3574.Maximize Subarray GCD Score/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -308,6 +308,47 @@ function gcd(a: number, b: number): number {
}
```

#### Rust

```rust
impl Solution {
pub fn max_gcd_score(nums: Vec<i32>, k: i32) -> i64 {
let n = nums.len();
let mut cnt = vec![0i32; n];
for i in 0..n {
let mut x = nums[i];
while x % 2 == 0 {
cnt[i] += 1;
x /= 2;
}
}

let mut ans: i64 = 0;
for l in 0..n {
let mut g: i32 = 0;
let mut mi: i32 = 1 << 30;
let mut t: i32 = 0;
for r in l..n {
g = Self::gcd(g, nums[r]);
if cnt[r] < mi {
mi = cnt[r];
t = 1;
} else if cnt[r] == mi {
t += 1;
}
let val = if t > k { g as i64 } else { (g * 2) as i64 };
ans = ans.max((r as i64 - l as i64 + 1) * val);
}
}
ans
}

fn gcd(a: i32, b: i32) -> i32 {
if b == 0 { a } else { Self::gcd(b, a % b) }
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
41 changes: 41 additions & 0 deletions solution/3500-3599/3574.Maximize Subarray GCD Score/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -304,6 +304,47 @@ function gcd(a: number, b: number): number {
}
```

#### Rust

```rust
impl Solution {
pub fn max_gcd_score(nums: Vec<i32>, k: i32) -> i64 {
let n = nums.len();
let mut cnt = vec![0i32; n];
for i in 0..n {
let mut x = nums[i];
while x % 2 == 0 {
cnt[i] += 1;
x /= 2;
}
}

let mut ans: i64 = 0;
for l in 0..n {
let mut g: i32 = 0;
let mut mi: i32 = 1 << 30;
let mut t: i32 = 0;
for r in l..n {
g = Self::gcd(g, nums[r]);
if cnt[r] < mi {
mi = cnt[r];
t = 1;
} else if cnt[r] == mi {
t += 1;
}
let val = if t > k { g as i64 } else { (g * 2) as i64 };
ans = ans.max((r as i64 - l as i64 + 1) * val);
}
}
ans
}

fn gcd(a: i32, b: i32) -> i32 {
if b == 0 { a } else { Self::gcd(b, a % b) }
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
36 changes: 36 additions & 0 deletions solution/3500-3599/3574.Maximize Subarray GCD Score/Solution.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,36 @@
impl Solution {
pub fn max_gcd_score(nums: Vec<i32>, k: i32) -> i64 {
let n = nums.len();
let mut cnt = vec![0i32; n];
for i in 0..n {
let mut x = nums[i];
while x % 2 == 0 {
cnt[i] += 1;
x /= 2;
}
}

let mut ans: i64 = 0;
for l in 0..n {
let mut g: i32 = 0;
let mut mi: i32 = 1 << 30;
let mut t: i32 = 0;
for r in l..n {
g = Self::gcd(g, nums[r]);
if cnt[r] < mi {
mi = cnt[r];
t = 1;
} else if cnt[r] == mi {
t += 1;
}
let val = if t > k { g as i64 } else { (g * 2) as i64 };
ans = ans.max((r as i64 - l as i64 + 1) * val);
}
}
ans
}

fn gcd(a: i32, b: i32) -> i32 {
if b == 0 { a } else { Self::gcd(b, a % b) }
}
}