Skip to content

feat: update solutions to lc problems: No.9~13 #3111

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
Jun 15, 2024
Merged

feat: update solutions to lc problems: No.9~13 #3111

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
25 changes: 0 additions & 25 deletions solution/0000-0099/0009.Palindrome Number/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -174,31 +174,6 @@ function isPalindrome(x: number): boolean {

#### Rust

```rust
impl Solution {
pub fn is_palindrome(x: i32) -> bool {
if x < 0 {
return false;
}
let s = x.to_string();
let bs = s.as_bytes();
let n = bs.len();
let mut l = 0;
let mut r = n - 1;
while l < r {
if bs[l] != bs[r] {
return false;
}
l += 1;
r -= 1;
}
true
}
}
```

#### Rust

```rust
impl Solution {
pub fn is_palindrome(mut x: i32) -> bool {
Expand Down
25 changes: 0 additions & 25 deletions solution/0000-0099/0009.Palindrome Number/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -166,31 +166,6 @@ function isPalindrome(x: number): boolean {

#### Rust

```rust
impl Solution {
pub fn is_palindrome(x: i32) -> bool {
if x < 0 {
return false;
}
let s = x.to_string();
let bs = s.as_bytes();
let n = bs.len();
let mut l = 0;
let mut r = n - 1;
while l < r {
if bs[l] != bs[r] {
return false;
}
l += 1;
r -= 1;
}
true
}
}
```

#### Rust

```rust
impl Solution {
pub fn is_palindrome(mut x: i32) -> bool {
Expand Down
14 changes: 0 additions & 14 deletions solution/0000-0099/0009.Palindrome Number/Solution2.rs
View file
Open in desktop

This file was deleted.

90 changes: 61 additions & 29 deletions solution/0000-0099/0010.Regular Expression Matching/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -211,41 +211,41 @@ func isMatch(s string, p string) bool {

```rust
impl Solution {
#[allow(dead_code)]
pub fn is_match(s: String, p: String) -> bool {
let n = s.len();
let m = p.len();
let s = s.chars().collect::<Vec<char>>();
let p = p.chars().collect::<Vec<char>>();

let mut dp = vec![vec![false; m + 1]; n + 1];

// Initialize the dp vector
dp[0][0] = true;

for i in 1..=m {
if p[i - 1] == '*' {
dp[0][i] = dp[0][i - 2];
let (m, n) = (s.len(), p.len());
let mut f = vec![vec![0; n + 1]; m + 1];

fn dfs(
s: &Vec<char>,
p: &Vec<char>,
f: &mut Vec<Vec<i32>>,
i: usize,
j: usize,
m: usize,
n: usize
) -> bool {
if j >= n {
return i == m;
}
}

// Begin the actual dp process
for i in 1..=n {
for j in 1..=m {
if s[i - 1] == p[j - 1] || p[j - 1] == '.' {
dp[i][j] = dp[i - 1][j - 1];
}
if p[j - 1] == '*' {
if j >= 2 && (s[i - 1] == p[j - 2] || p[j - 2] == '.') {
dp[i][j] = dp[i - 1][j] || dp[i][j - 2];
} else if j >= 2 && s[i - 1] != p[j - 2] {
dp[i][j] = dp[i][j - 2];
}
if f[i][j] != 0 {
return f[i][j] == 1;
}
let mut res = -1;
if j + 1 < n && p[j + 1] == '*' {
if
dfs(s, p, f, i, j + 2, m, n) ||
(i < m && (s[i] == p[j] || p[j] == '.') && dfs(s, p, f, i + 1, j, m, n))
{
res = 1;
}
} else if i < m && (s[i] == p[j] || p[j] == '.') && dfs(s, p, f, i + 1, j + 1, m, n) {
res = 1;
}
f[i][j] = res;
res == 1
}

dp[n][m]
dfs(&s.chars().collect(), &p.chars().collect(), &mut f, 0, 0, m, n)
}
}
```
Expand Down Expand Up @@ -443,6 +443,38 @@ func isMatch(s string, p string) bool {
}
```

#### Rust

```rust
impl Solution {
pub fn is_match(s: String, p: String) -> bool {
let m = s.len();
let n = p.len();
let mut f = vec![vec![false; n + 1]; m + 1];

f[0][0] = true;

let s: Vec<char> = s.chars().collect();
let p: Vec<char> = p.chars().collect();

for i in 0..=m {
for j in 1..=n {
if p[j - 1] == '*' {
f[i][j] = f[i][j - 2];
if i > 0 && (p[j - 2] == '.' || p[j - 2] == s[i - 1]) {
f[i][j] = f[i][j] || f[i - 1][j];
}
} else if i > 0 && (p[j - 1] == '.' || p[j - 1] == s[i - 1]) {
f[i][j] = f[i - 1][j - 1];
}
}
}

f[m][n]
}
}
```

#### JavaScript

```js
Expand Down
90 changes: 61 additions & 29 deletions solution/0000-0099/0010.Regular Expression Matching/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -210,41 +210,41 @@ func isMatch(s string, p string) bool {

```rust
impl Solution {
#[allow(dead_code)]
pub fn is_match(s: String, p: String) -> bool {
let n = s.len();
let m = p.len();
let s = s.chars().collect::<Vec<char>>();
let p = p.chars().collect::<Vec<char>>();

let mut dp = vec![vec![false; m + 1]; n + 1];

// Initialize the dp vector
dp[0][0] = true;

for i in 1..=m {
if p[i - 1] == '*' {
dp[0][i] = dp[0][i - 2];
let (m, n) = (s.len(), p.len());
let mut f = vec![vec![0; n + 1]; m + 1];

fn dfs(
s: &Vec<char>,
p: &Vec<char>,
f: &mut Vec<Vec<i32>>,
i: usize,
j: usize,
m: usize,
n: usize
) -> bool {
if j >= n {
return i == m;
}
}

// Begin the actual dp process
for i in 1..=n {
for j in 1..=m {
if s[i - 1] == p[j - 1] || p[j - 1] == '.' {
dp[i][j] = dp[i - 1][j - 1];
}
if p[j - 1] == '*' {
if j >= 2 && (s[i - 1] == p[j - 2] || p[j - 2] == '.') {
dp[i][j] = dp[i - 1][j] || dp[i][j - 2];
} else if j >= 2 && s[i - 1] != p[j - 2] {
dp[i][j] = dp[i][j - 2];
}
if f[i][j] != 0 {
return f[i][j] == 1;
}
let mut res = -1;
if j + 1 < n && p[j + 1] == '*' {
if
dfs(s, p, f, i, j + 2, m, n) ||
(i < m && (s[i] == p[j] || p[j] == '.') && dfs(s, p, f, i + 1, j, m, n))
{
res = 1;
}
} else if i < m && (s[i] == p[j] || p[j] == '.') && dfs(s, p, f, i + 1, j + 1, m, n) {
res = 1;
}
f[i][j] = res;
res == 1
}

dp[n][m]
dfs(&s.chars().collect(), &p.chars().collect(), &mut f, 0, 0, m, n)
}
}
```
Expand Down Expand Up @@ -442,6 +442,38 @@ func isMatch(s string, p string) bool {
}
```

#### Rust

```rust
impl Solution {
pub fn is_match(s: String, p: String) -> bool {
let m = s.len();
let n = p.len();
let mut f = vec![vec![false; n + 1]; m + 1];

f[0][0] = true;

let s: Vec<char> = s.chars().collect();
let p: Vec<char> = p.chars().collect();

for i in 0..=m {
for j in 1..=n {
if p[j - 1] == '*' {
f[i][j] = f[i][j - 2];
if i > 0 && (p[j - 2] == '.' || p[j - 2] == s[i - 1]) {
f[i][j] = f[i][j] || f[i - 1][j];
}
} else if i > 0 && (p[j - 1] == '.' || p[j - 1] == s[i - 1]) {
f[i][j] = f[i - 1][j - 1];
}
}
}

f[m][n]
}
}
```

#### JavaScript

```js
Expand Down
56 changes: 28 additions & 28 deletions solution/0000-0099/0010.Regular Expression Matching/Solution.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,38 +1,38 @@
impl Solution {
#[allow(dead_code)]
pub fn is_match(s: String, p: String) -> bool {
let n = s.len();
let m = p.len();
let s = s.chars().collect::<Vec<char>>();
let p = p.chars().collect::<Vec<char>>();
let (m, n) = (s.len(), p.len());
let mut f = vec![vec![0; n + 1]; m + 1];

let mut dp = vec![vec![false; m + 1]; n + 1];

// Initialize the dp vector
dp[0][0] = true;

for i in 1..=m {
if p[i - 1] == '*' {
dp[0][i] = dp[0][i - 2];
fn dfs(
s: &Vec<char>,
p: &Vec<char>,
f: &mut Vec<Vec<i32>>,
i: usize,
j: usize,
m: usize,
n: usize
) -> bool {
if j >= n {
return i == m;
}
}

// Begin the actual dp process
for i in 1..=n {
for j in 1..=m {
if s[i - 1] == p[j - 1] || p[j - 1] == '.' {
dp[i][j] = dp[i - 1][j - 1];
}
if p[j - 1] == '*' {
if j >= 2 && (s[i - 1] == p[j - 2] || p[j - 2] == '.') {
dp[i][j] = dp[i - 1][j] || dp[i][j - 2];
} else if j >= 2 && s[i - 1] != p[j - 2] {
dp[i][j] = dp[i][j - 2];
}
if f[i][j] != 0 {
return f[i][j] == 1;
}
let mut res = -1;
if j + 1 < n && p[j + 1] == '*' {
if
dfs(s, p, f, i, j + 2, m, n) ||
(i < m && (s[i] == p[j] || p[j] == '.') && dfs(s, p, f, i + 1, j, m, n))
{
res = 1;
}
} else if i < m && (s[i] == p[j] || p[j] == '.') && dfs(s, p, f, i + 1, j + 1, m, n) {
res = 1;
}
f[i][j] = res;
res == 1
}

dp[n][m]
dfs(&s.chars().collect(), &p.chars().collect(), &mut f, 0, 0, m, n)
}
}
27 changes: 27 additions & 0 deletions solution/0000-0099/0010.Regular Expression Matching/Solution2.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,27 @@
impl Solution {
pub fn is_match(s: String, p: String) -> bool {
let m = s.len();
let n = p.len();
let mut f = vec![vec![false; n + 1]; m + 1];

f[0][0] = true;

let s: Vec<char> = s.chars().collect();
let p: Vec<char> = p.chars().collect();

for i in 0..=m {
for j in 1..=n {
if p[j - 1] == '*' {
f[i][j] = f[i][j - 2];
if i > 0 && (p[j - 2] == '.' || p[j - 2] == s[i - 1]) {
f[i][j] = f[i][j] || f[i - 1][j];
}
} else if i > 0 && (p[j - 1] == '.' || p[j - 1] == s[i - 1]) {
f[i][j] = f[i - 1][j - 1];
}
}
}

f[m][n]
}
}
Loading
Loading