Skip to content

[pull] main from doocs:main #466

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 4 commits into from
Apr 10, 2025
Merged

[pull] main from doocs:main #466

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
396713a
feat: update solutions to lc problem: No.3375 (#4341)
rain84 Apr 9, 2025
6837834
feat: add rust solution to lc problem: No.2999 (#4342)
yanglbme Apr 9, 2025
3811f0b
feat: add solution to lc problem: No.3485 (#4340)
Parth-Dholariya Apr 9, 2025
b0ca983
chore: auto update starcharts
idoocs Apr 10, 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
56,261 changes: 28,184 additions & 28,077 deletions images/starcharts.svg
View file
Open in desktop
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
69 changes: 69 additions & 0 deletions solution/2900-2999/2999.Count the Number of Powerful Integers/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -310,6 +310,75 @@ function numberOfPowerfulInt(start: number, finish: number, limit: number, s: st
}
```

#### Rust

```rust
impl Solution {
pub fn number_of_powerful_int(start: i64, finish: i64, limit: i32, s: String) -> i64 {
fn count(x: i64, limit: i32, s: &str) -> i64 {
let t = x.to_string();
if t.len() < s.len() {
return 0;
}

let t_bytes: Vec<u8> = t.bytes().collect();
let mut f = [-1_i64; 20];

fn dfs(
pos: usize,
lim: bool,
t: &[u8],
s: &str,
limit: i32,
f: &mut [i64; 20],
) -> i64 {
if t.len() < s.len() {
return 0;
}

if !lim && f[pos] != -1 {
return f[pos];
}

if t.len() - pos == s.len() {
if lim {
let suffix = &t[pos..];
let suffix_str = String::from_utf8_lossy(suffix);
return if suffix_str.as_ref() >= s { 1 } else { 0 };
} else {
return 1;
}
}

let mut ans = 0;
let up = if lim {
(t[pos] - b'0').min(limit as u8)
} else {
limit as u8
};

for i in 0..=up {
let next_lim = lim && i == t[pos] - b'0';
ans += dfs(pos + 1, next_lim, t, s, limit, f);
}

if !lim {
f[pos] = ans;
}

ans
}

dfs(0, true, &t_bytes, s, limit, &mut f)
}

let a = count(start - 1, limit, &s);
let b = count(finish, limit, &s);
b - a
}
}
```

#### C#

```cs
Expand Down
69 changes: 69 additions & 0 deletions solution/2900-2999/2999.Count the Number of Powerful Integers/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -308,6 +308,75 @@ function numberOfPowerfulInt(start: number, finish: number, limit: number, s: st
}
```

#### Rust

```rust
impl Solution {
pub fn number_of_powerful_int(start: i64, finish: i64, limit: i32, s: String) -> i64 {
fn count(x: i64, limit: i32, s: &str) -> i64 {
let t = x.to_string();
if t.len() < s.len() {
return 0;
}

let t_bytes: Vec<u8> = t.bytes().collect();
let mut f = [-1_i64; 20];

fn dfs(
pos: usize,
lim: bool,
t: &[u8],
s: &str,
limit: i32,
f: &mut [i64; 20],
) -> i64 {
if t.len() < s.len() {
return 0;
}

if !lim && f[pos] != -1 {
return f[pos];
}

if t.len() - pos == s.len() {
if lim {
let suffix = &t[pos..];
let suffix_str = String::from_utf8_lossy(suffix);
return if suffix_str.as_ref() >= s { 1 } else { 0 };
} else {
return 1;
}
}

let mut ans = 0;
let up = if lim {
(t[pos] - b'0').min(limit as u8)
} else {
limit as u8
};

for i in 0..=up {
let next_lim = lim && i == t[pos] - b'0';
ans += dfs(pos + 1, next_lim, t, s, limit, f);
}

if !lim {
f[pos] = ans;
}

ans
}

dfs(0, true, &t_bytes, s, limit, &mut f)
}

let a = count(start - 1, limit, &s);
let b = count(finish, limit, &s);
b - a
}
}
```

#### C#

```cs
Expand Down
57 changes: 57 additions & 0 deletions solution/2900-2999/2999.Count the Number of Powerful Integers/Solution.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,57 @@
impl Solution {
pub fn number_of_powerful_int(start: i64, finish: i64, limit: i32, s: String) -> i64 {
fn count(x: i64, limit: i32, s: &str) -> i64 {
let t = x.to_string();
if t.len() < s.len() {
return 0;
}

let t_bytes: Vec<u8> = t.bytes().collect();
let mut f = [-1_i64; 20];

fn dfs(pos: usize, lim: bool, t: &[u8], s: &str, limit: i32, f: &mut [i64; 20]) -> i64 {
if t.len() < s.len() {
return 0;
}

if !lim && f[pos] != -1 {
return f[pos];
}

if t.len() - pos == s.len() {
if lim {
let suffix = &t[pos..];
let suffix_str = String::from_utf8_lossy(suffix);
return if suffix_str.as_ref() >= s { 1 } else { 0 };
} else {
return 1;
}
}

let mut ans = 0;
let up = if lim {
(t[pos] - b'0').min(limit as u8)
} else {
limit as u8
};

for i in 0..=up {
let next_lim = lim && i == t[pos] - b'0';
ans += dfs(pos + 1, next_lim, t, s, limit, f);
}

if !lim {
f[pos] = ans;
}

ans
}

dfs(0, true, &t_bytes, s, limit, &mut f)
}

let a = count(start - 1, limit, &s);
let b = count(finish, limit, &s);
b - a
}
}
23 changes: 16 additions & 7 deletions ...ion/3300-3399/3375.Minimum Operations to Make Array Values Equal to K/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -176,16 +176,25 @@ func minOperations(nums []int, k int) int {

```ts
function minOperations(nums: number[], k: number): number {
const s = new Set<number>();
let mi = Infinity;
const s = new Set<number>([k]);
for (const x of nums) {
if (x < k) {
return -1;
}
if (x < k) return -1;
s.add(x);
}
return s.size - 1;
}
```

#### JavaScript

```js
function minOperations(nums, k) {
const s = new Set([k]);
for (const x of nums) {
if (x < k) return -1;
s.add(x);
mi = Math.min(mi, x);
}
return s.size - (mi === k ? 1 : 0);
return s.size - 1;
}
```

Expand Down
23 changes: 16 additions & 7 deletions .../3300-3399/3375.Minimum Operations to Make Array Values Equal to K/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -174,16 +174,25 @@ func minOperations(nums []int, k int) int {

```ts
function minOperations(nums: number[], k: number): number {
const s = new Set<number>();
let mi = Infinity;
const s = new Set<number>([k]);
for (const x of nums) {
if (x < k) {
return -1;
}
if (x < k) return -1;
s.add(x);
}
return s.size - 1;
}
```

#### JavaScript

```js
function minOperations(nums, k) {
const s = new Set([k]);
for (const x of nums) {
if (x < k) return -1;
s.add(x);
mi = Math.min(mi, x);
}
return s.size - (mi === k ? 1 : 0);
return s.size - 1;
}
```

Expand Down
8 changes: 8 additions & 0 deletions solution/3300-3399/3375.Minimum Operations to Make Array Values Equal to K/Solution.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,8 @@
function minOperations(nums, k) {
const s = new Set([k]);
for (const x of nums) {
if (x < k) return -1;
s.add(x);
}
return s.size - 1;
}
10 changes: 3 additions & 7 deletions solution/3300-3399/3375.Minimum Operations to Make Array Values Equal to K/Solution.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,12 +1,8 @@
function minOperations(nums: number[], k: number): number {
const s = new Set<number>();
let mi = Infinity;
const s = new Set<number>([k]);
for (const x of nums) {
if (x < k) {
return -1;
}
if (x < k) return -1;
s.add(x);
mi = Math.min(mi, x);
}
return s.size - (mi === k ? 1 : 0);
return s.size - 1;
}
Loading