0433-minimum-genetic-mutation¶
Try it on leetcode
Description¶
A gene string can be represented by an 8-character long string, with choices from 'A', 'C', 'G', and 'T'.
Suppose we need to investigate a mutation from a gene string startGene to a gene string endGene where one mutation is defined as one single character changed in the gene string.
- For example,
"AACCGGTT" --> "AACCGGTA"is one mutation.
There is also a gene bank bank that records all the valid gene mutations. A gene must be in bank to make it a valid gene string.
Given the two gene strings startGene and endGene and the gene bank bank, return the minimum number of mutations needed to mutate from startGene to endGene. If there is no such a mutation, return -1.
Note that the starting point is assumed to be valid, so it might not be included in the bank.
Example 1:
Input: startGene = "AACCGGTT", endGene = "AACCGGTA", bank = ["AACCGGTA"] Output: 1
Example 2:
Input: startGene = "AACCGGTT", endGene = "AAACGGTA", bank = ["AACCGGTA","AACCGCTA","AAACGGTA"] Output: 2
Constraints:
0 <= bank.length <= 10startGene.length == endGene.length == bank[i].length == 8startGene,endGene, andbank[i]consist of only the characters['A', 'C', 'G', 'T'].
Solution(Python)¶
from collections import deque
class Solution:
def minMutation(self, startGene: str, endGene: str, bank: list[str]) -> int:
# gene string 8 charcater acgtacgt
# if each string is node and mutations is a edge
# build graph from bank
# how to do build raph
# only have list of all gene
# run bfs to shortest path
# sub problem 1 converting to graph
# approach a explicitly compre all pairs
# approach b build dynamically
# take current gene chnage each charcter
# chek cwhether it ecistsoiin bank
# if it exists and han't been visited add it to bfs queue
bank_set = set(bank)
if endGene not in bank_set:
return -1
genes = ['A','C','G','T']
q = deque([(startGene, 0)])
visited = {startGene}
while q:
gene, mutation = q.popleft()
if gene == endGene:
return mutation
for i in range(8):
for char in genes:
mutated = gene[:i] + char + gene[i+1:]
if mutated in bank_set and mutated not in visited:
visited.add(mutated)
q.append((mutated, mutation + 1))
return -1