LeetCode 솔루션

[11/2] 433. Minimum Genetic Mutation

학부유학생 쪽지보내기 메일보내기 자기소개 아이디로 검색 전체게시물 작성
작성일 2022.11.02 08:29

4,851 조회
1 댓글
1 추천
0 비추천
목록 게시글 쓰기

Medium

1813185Add to ListShare

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 start to a gene string end 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 start and end and the gene bank bank, return the minimum number of mutations needed to mutate from start to end. 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: start = "AACCGGTT", end = "AACCGGTA", bank = ["AACCGGTA"]
Output: 1

Example 2:

Input: start = "AACCGGTT", end = "AAACGGTA", bank = ["AACCGGTA","AACCGCTA","AAACGGTA"]
Output: 2

Example 3:

Input: start = "AAAAACCC", end = "AACCCCCC", bank = ["AAAACCCC","AAACCCCC","AACCCCCC"]
Output: 3

Constraints:

start.length == 8
end.length == 8
0 <= bank.length <= 10
bank[i].length == 8
start, end, and bank[i] consist of only the characters ['A', 'C', 'G', 'T'].

Accepted

85,816

Submissions

170,100

#Amazon

링크

https://leetcode.com/problems/minimum-genetic-mutation/ 540 회 연결

익명
작성일 2022.11.02 08:30

Runtime: 58 ms, faster than 41.86% of Python3 online submissions for Minimum Genetic Mutation.
Memory Usage: 13.9 MB, less than 37.43% of Python3 online submissions for Minimum Genetic Mutation.

class Solution:
    def minMutation(self, start: str, end: str, bank: List[str]) -> int:
        # path
        bank = set(bank)

        def onediff(a,b):
            return sum(c1!=c2 for c1,c2 in zip(a,b)) == 1
        
        
        res = float('inf')
        
        def dfs(curr,depth):
            nonlocal res
            if depth > res: return
            
            if curr == end:
                res = min(res, depth)
                return
            
            bank.remove(curr)
            
            for string in bank:
                if onediff(curr,string):
                    dfs(string, depth+1)
            
            bank.add(curr)
            
        
        bank.add(start)
        dfs(start, 0)
        return -1 if res == float('inf') else res

Runtime: 58 ms, faster than 41.86% of Python3 online submissions for Minimum Genetic Mutation.
Memory Usage: 13.9 MB, less than 37.43% of Python3 online submissions for Minimum Genetic Mutation.
[code=Python 3]class Solution:
    def minMutation(self, start: str, end: str, bank: List[str]) -> int:
        # path
        bank = set(bank)

def onediff(a,b):
            return sum(c1!=c2 for c1,c2 in zip(a,b)) == 1
        
        
        res = float('inf')
        
        def dfs(curr,depth):
            nonlocal res
            if depth > res: return
            
            if curr == end:
                res = min(res, depth)
                return
            
            bank.remove(curr)
            
            for string in bank:
                if onediff(curr,string):
                    dfs(string, depth+1)
            
            bank.add(curr)
            
        
        bank.add(start)
        dfs(start, 0)
        return -1 if res == float('inf') else res[/code]