-
Notifications
You must be signed in to change notification settings - Fork 0
/
433. 最小基因变化.php
62 lines (58 loc) · 1.77 KB
/
433. 最小基因变化.php
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
<?php
/**
* Created by PhpStorm
* User: jtahstu
* Time: 2022/5/7 0:36
* Des: 433. 最小基因变化
* https://leetcode.cn/problems/minimum-genetic-mutation/
*/
class Solution
{
public static $list = ['A', 'C', 'G', 'T'];
/**
* @param String $start
* @param String $end
* @param String[] $bank
* @return
*/
function minMutation($start, $end, $bank)
{
if ($start == $end) {
return 0;
}
$bank = array_unique($bank);
if (!in_array($end, $bank)) {
return -1;
}
$res[$start] = 0;
$wds = [$start];
while ($wds) {
$wd = array_shift($wds);
for ($i = 0; $i < strlen($wd); $i++) {
$wd_new = $wd;
for ($j = 0; $j < 4; $j++) {
if ($wd_new[$i] == self::$list[$j]) {
continue;
}
$wd_new[$i] = self::$list[$j];
if (in_array($wd_new, $bank) && !isset($res[$wd_new])) {
$res[$wd_new] = $res[$wd] + 1;
if ($wd_new == $end) {
// print_r($res);
return $res[$wd_new];
}
array_push($wds, $wd_new);
}
}
}
}
return -1;
}
}
var_dump((new Solution)->minMutation("AACCGGTT", "AAACGGTA", ["AACCGGTA", "AACCGCTA", "AAACGGTA"]));
var_dump((new Solution)->minMutation("AAAAACCC", "AACCCCCC", ["AAAACCCC", "AAACCCCC", "AACCCCCC"]));
/**
* 执行用时:12 ms, 在所有 PHP 提交中击败了100.00%的用户
* 内存消耗:18.4 MB, 在所有 PHP 提交中击败了100.00%的用户
* 通过测试用例:14 / 14
*/