Skip to content

Commit 3811cc1

Browse files
pranjal030404pranjal030404
authored
Merge branch 'main' into main
2 parents 3b9a66c + 6d918ed commit 3811cc1

File tree

7 files changed

+252
-71
lines changed

7 files changed

+252
-71
lines changed

‎solution/0000-0099/0010.Regular Expression Matching/README.md‎

Lines changed: 54 additions & 23 deletions
Original file line numberDiff line numberDiff line change
@@ -365,7 +365,47 @@ bool isMatch(char* s, char* p) {
365365
m = strlen(s);
366366
n = strlen(p);
367367
memset(f, 0, sizeof(f));
368-
return dfs(0, 0);
368+
return dfs(0, 0)
369+
```
370+
371+
#### PHP
372+
373+
```php
374+
class Solution {
375+
/**
376+
* @param String $s
377+
* @param String $p
378+
* @return Boolean
379+
*/
380+
function isMatch($s, $p) {
381+
$m = strlen($s);
382+
$n = strlen($p);
383+
$f = array_fill(0, $m + 1, array_fill(0, $n + 1, 0));
384+
385+
$dfs = function ($i, $j) use (&$s, &$p, $m, $n, &$f, &$dfs) {
386+
if ($j >= $n) {
387+
return $i == $m;
388+
}
389+
if ($f[$i][$j] != 0) {
390+
return $f[$i][$j] == 1;
391+
}
392+
$res = -1;
393+
if ($j + 1 < $n && $p[$j + 1] == '*') {
394+
if (
395+
$dfs($i, $j + 2) ||
396+
($i < $m && ($s[$i] == $p[$j] || $p[$j] == '.') && $dfs($i + 1, $j))
397+
) {
398+
$res = 1;
399+
}
400+
} elseif ($i < $m && ($s[$i] == $p[$j] || $p[$j] == '.') && $dfs($i + 1, $j + 1)) {
401+
$res = 1;
402+
}
403+
$f[$i][$j] = $res;
404+
return $res == 1;
405+
};
406+
407+
return $dfs(0, 0);
408+
}
369409
}
370410
```
371411

@@ -579,40 +619,31 @@ public class Solution {
579619
```php
580620
class Solution {
581621
/**
582-
* @param string $s
583-
* @param string $p
584-
* @return boolean
622+
* @param String $s
623+
* @param String $p
624+
* @return Boolean
585625
*/
586-
587626
function isMatch($s, $p) {
588627
$m = strlen($s);
589628
$n = strlen($p);
590629

591-
$dp = array_fill(0, $m + 1, array_fill(0, $n + 1, false));
592-
$dp[0][0] = true;
593-
594-
for ($j = 1; $j <= $n; $j++) {
595-
if ($p[$j - 1] == '*') {
596-
$dp[0][$j] = $dp[0][$j - 2];
597-
}
598-
}
630+
$f = array_fill(0, $m + 1, array_fill(0, $n + 1, false));
631+
$f[0][0] = true;
599632

600-
for ($i = 1; $i <= $m; $i++) {
633+
for ($i = 0; $i <= $m; $i++) {
601634
for ($j = 1; $j <= $n; $j++) {
602-
if ($p[$j - 1] == '.' || $p[$j - 1] == $s[$i - 1]) {
603-
$dp[$i][$j] = $dp[$i - 1][$j - 1];
604-
} elseif ($p[$j - 1] == '*') {
605-
$dp[$i][$j] = $dp[$i][$j - 2];
606-
if ($p[$j - 2] == '.' || $p[$j - 2] == $s[$i - 1]) {
607-
$dp[$i][$j] = $dp[$i][$j] || $dp[$i - 1][$j];
635+
if ($p[$j - 1] == '*') {
636+
$f[$i][$j] = $f[$i][$j - 2];
637+
if ($i > 0 && ($p[$j - 2] == '.' || $p[$j - 2] == $s[$i - 1])) {
638+
$f[$i][$j] = $f[$i][$j] || $f[$i - 1][$j];
608639
}
609-
} else {
610-
$dp[$i][$j] = false;
640+
} elseif ($i > 0 && ($p[$j - 1] == '.' || $p[$j - 1] == $s[$i - 1])) {
641+
$f[$i][$j] = $f[$i - 1][$j - 1];
611642
}
612643
}
613644
}
614645

615-
return $dp[$m][$n];
646+
return $f[$m][$n];
616647
}
617648
}
618649
```

‎solution/0000-0099/0010.Regular Expression Matching/README_EN.md‎

Lines changed: 54 additions & 22 deletions
Original file line numberDiff line numberDiff line change
@@ -367,6 +367,47 @@ bool isMatch(char* s, char* p) {
367367
return dfs(0, 0);
368368
}
369369
```
370+
#### PHP
371+
372+
```php
373+
class Solution {
374+
/**
375+
* @param String $s
376+
* @param String $p
377+
* @return Boolean
378+
*/
379+
function isMatch($s, $p) {
380+
$m = strlen($s);
381+
$n = strlen($p);
382+
$f = array_fill(0, $m + 1, array_fill(0, $n + 1, 0));
383+
384+
$dfs = function ($i, $j) use (&$s, &$p, $m, $n, &$f, &$dfs) {
385+
if ($j >= $n) {
386+
return $i == $m;
387+
}
388+
if ($f[$i][$j] != 0) {
389+
return $f[$i][$j] == 1;
390+
}
391+
$res = -1;
392+
if ($j + 1 < $n && $p[$j + 1] == '*') {
393+
if (
394+
$dfs($i, $j + 2) ||
395+
($i < $m && ($s[$i] == $p[$j] || $p[$j] == '.') && $dfs($i + 1, $j))
396+
) {
397+
$res = 1;
398+
}
399+
} elseif ($i < $m && ($s[$i] == $p[$j] || $p[$j] == '.') && $dfs($i + 1, $j + 1)) {
400+
$res = 1;
401+
}
402+
$f[$i][$j] = $res;
403+
return $res == 1;
404+
};
405+
406+
return $dfs(0, 0);
407+
}
408+
}
409+
```
410+
370411

371412
<!-- tabs:end -->
372413

@@ -578,40 +619,31 @@ public class Solution {
578619
```php
579620
class Solution {
580621
/**
581-
* @param string $s
582-
* @param string $p
583-
* @return boolean
622+
* @param String $s
623+
* @param String $p
624+
* @return Boolean
584625
*/
585-
586626
function isMatch($s, $p) {
587627
$m = strlen($s);
588628
$n = strlen($p);
589629

590-
$dp = array_fill(0, $m + 1, array_fill(0, $n + 1, false));
591-
$dp[0][0] = true;
592-
593-
for ($j = 1; $j <= $n; $j++) {
594-
if ($p[$j - 1] == '*') {
595-
$dp[0][$j] = $dp[0][$j - 2];
596-
}
597-
}
630+
$f = array_fill(0, $m + 1, array_fill(0, $n + 1, false));
631+
$f[0][0] = true;
598632

599-
for ($i = 1; $i <= $m; $i++) {
633+
for ($i = 0; $i <= $m; $i++) {
600634
for ($j = 1; $j <= $n; $j++) {
601-
if ($p[$j - 1] == '.' || $p[$j - 1] == $s[$i - 1]) {
602-
$dp[$i][$j] = $dp[$i - 1][$j - 1];
603-
} elseif ($p[$j - 1] == '*') {
604-
$dp[$i][$j] = $dp[$i][$j - 2];
605-
if ($p[$j - 2] == '.' || $p[$j - 2] == $s[$i - 1]) {
606-
$dp[$i][$j] = $dp[$i][$j] || $dp[$i - 1][$j];
635+
if ($p[$j - 1] == '*') {
636+
$f[$i][$j] = $f[$i][$j - 2];
637+
if ($i > 0 && ($p[$j - 2] == '.' || $p[$j - 2] == $s[$i - 1])) {
638+
$f[$i][$j] = $f[$i][$j] || $f[$i - 1][$j];
607639
}
608-
} else {
609-
$dp[$i][$j] = false;
640+
} elseif ($i > 0 && ($p[$j - 1] == '.' || $p[$j - 1] == $s[$i - 1])) {
641+
$f[$i][$j] = $f[$i - 1][$j - 1];
610642
}
611643
}
612644
}
613645

614-
return $dp[$m][$n];
646+
return $f[$m][$n];
615647
}
616648
}
617649
```

‎solution/0000-0099/0010.Regular Expression Matching/Solution.php‎

Lines changed: 24 additions & 26 deletions
Original file line numberDiff line numberDiff line change
@@ -1,38 +1,36 @@
11
class Solution {
22
/**
3-
* @param string $s
4-
* @param string $p
5-
* @return boolean
3+
* @param String $s
4+
* @param String $p
5+
* @return Boolean
66
*/
7-
87
function isMatch($s, $p) {
98
$m = strlen($s);
109
$n = strlen($p);
10+
$f = array_fill(0, $m + 1, array_fill(0, $n + 1, 0));
1111

12-
$dp = array_fill(0, $m + 1, array_fill(0, $n + 1, false));
13-
$dp[0][0] = true;
14-
15-
for ($j = 1; $j <= $n; $j++) {
16-
if ($p[$j - 1] == '*') {
17-
$dp[0][$j] = $dp[0][$j - 2];
12+
$dfs = function ($i, $j) use (&$s, &$p, $m, $n, &$f, &$dfs) {
13+
if ($j >= $n) {
14+
return $i == $m;
1815
}
19-
}
20-
21-
for ($i = 1; $i <= $m; $i++) {
22-
for ($j = 1; $j <= $n; $j++) {
23-
if ($p[$j - 1] == '.' || $p[$j - 1] == $s[$i - 1]) {
24-
$dp[$i][$j] = $dp[$i - 1][$j - 1];
25-
} elseif ($p[$j - 1] == '*') {
26-
$dp[$i][$j] = $dp[$i][$j - 2];
27-
if ($p[$j - 2] == '.' || $p[$j - 2] == $s[$i - 1]) {
28-
$dp[$i][$j] = $dp[$i][$j] || $dp[$i - 1][$j];
29-
}
30-
} else {
31-
$dp[$i][$j] = false;
16+
if ($f[$i][$j] != 0) {
17+
return $f[$i][$j] == 1;
18+
}
19+
$res = -1;
20+
if ($j + 1 < $n && $p[$j + 1] == '*') {
21+
if (
22+
$dfs($i, $j + 2) ||
23+
($i < $m && ($s[$i] == $p[$j] || $p[$j] == '.') && $dfs($i + 1, $j))
24+
) {
25+
$res = 1;
3226
}
27+
} elseif ($i < $m && ($s[$i] == $p[$j] || $p[$j] == '.') && $dfs($i + 1, $j + 1)) {
28+
$res = 1;
3329
}
34-
}
30+
$f[$i][$j] = $res;
31+
return $res == 1;
32+
};
3533

36-
return $dp[$m][$n];
34+
return $dfs(0, 0);
3735
}
38-
}
36+
}

‎solution/0000-0099/0010.Regular Expression Matching/Solution2.php‎

Lines changed: 29 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,29 @@
1+
class Solution {
2+
/**
3+
* @param String $s
4+
* @param String $p
5+
* @return Boolean
6+
*/
7+
function isMatch($s, $p) {
8+
$m = strlen($s);
9+
$n = strlen($p);
10+
11+
$f = array_fill(0, $m + 1, array_fill(0, $n + 1, false));
12+
$f[0][0] = true;
13+
14+
for ($i = 0; $i <= $m; $i++) {
15+
for ($j = 1; $j <= $n; $j++) {
16+
if ($p[$j - 1] == '*') {
17+
$f[$i][$j] = $f[$i][$j - 2];
18+
if ($i > 0 && ($p[$j - 2] == '.' || $p[$j - 2] == $s[$i - 1])) {
19+
$f[$i][$j] = $f[$i][$j] || $f[$i - 1][$j];
20+
}
21+
} elseif ($i > 0 && ($p[$j - 1] == '.' || $p[$j - 1] == $s[$i - 1])) {
22+
$f[$i][$j] = $f[$i - 1][$j - 1];
23+
}
24+
}
25+
}
26+
27+
return $f[$m][$n];
28+
}
29+
}

‎solution/3400-3499/3443.Maximum Manhattan Distance After K Changes/README.md‎

Lines changed: 32 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -279,6 +279,38 @@ function maxDistance(s: string, k: number): number {
279279
}
280280
```
281281

282+
#### Rust
283+
284+
```rust
285+
impl Solution {
286+
pub fn max_distance(s: String, k: i32) -> i32 {
287+
fn calc(s: &str, a: char, b: char, k: i32) -> i32 {
288+
let mut ans = 0;
289+
let mut mx = 0;
290+
let mut cnt = 0;
291+
for c in s.chars() {
292+
if c == a || c == b {
293+
mx += 1;
294+
} else if cnt < k {
295+
mx += 1;
296+
cnt += 1;
297+
} else {
298+
mx -= 1;
299+
}
300+
ans = ans.max(mx);
301+
}
302+
ans
303+
}
304+
305+
let a = calc(&s, 'S', 'E', k);
306+
let b = calc(&s, 'S', 'W', k);
307+
let c = calc(&s, 'N', 'E', k);
308+
let d = calc(&s, 'N', 'W', k);
309+
a.max(b).max(c).max(d)
310+
}
311+
}
312+
```
313+
282314
<!-- tabs:end -->
283315

284316
<!-- solution:end -->

‎solution/3400-3499/3443.Maximum Manhattan Distance After K Changes/README_EN.md‎

Lines changed: 32 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -275,6 +275,38 @@ function maxDistance(s: string, k: number): number {
275275
}
276276
```
277277

278+
#### Rust
279+
280+
```rust
281+
impl Solution {
282+
pub fn max_distance(s: String, k: i32) -> i32 {
283+
fn calc(s: &str, a: char, b: char, k: i32) -> i32 {
284+
let mut ans = 0;
285+
let mut mx = 0;
286+
let mut cnt = 0;
287+
for c in s.chars() {
288+
if c == a || c == b {
289+
mx += 1;
290+
} else if cnt < k {
291+
mx += 1;
292+
cnt += 1;
293+
} else {
294+
mx -= 1;
295+
}
296+
ans = ans.max(mx);
297+
}
298+
ans
299+
}
300+
301+
let a = calc(&s, 'S', 'E', k);
302+
let b = calc(&s, 'S', 'W', k);
303+
let c = calc(&s, 'N', 'E', k);
304+
let d = calc(&s, 'N', 'W', k);
305+
a.max(b).max(c).max(d)
306+
}
307+
}
308+
```
309+
278310
<!-- tabs:end -->
279311

280312
<!-- solution:end -->

0 commit comments

Comments
 (0)