Skip to content

feat: add rust solution to lc problem: No.2999 #4342

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 1 commit into from
Apr 9, 2025
Merged

feat: add rust solution to lc problem: No.2999 #4342

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
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
}
}
Loading