JIAKAOBO

LeetCode

venmo
wechat

感谢赞助!

  • ㊗️
  • 大家
  • offer
  • 多多！

Problem

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

Code

class Solution {
    public int minMutation(String start, String end, String[] bank) {
        HashSet<String> set = new HashSet<>();
        for(String b : bank){
            set.add(b);
        }
        
        if(!set.contains(end)) return -1;
        
        Queue<String> queue = new LinkedList<>();
        HashSet<String> visited = new HashSet<>();
        
        char[] choices = {'A', 'C', 'G', 'T'};
        
        queue.offer(start);
        int step = 0;
        
        while(!queue.isEmpty()){
            int size = queue.size();
            
            for(int i = 0; i < size; i++){
                String curr = queue.poll();
                
                for(int m = 0; m < 8; m++){
                    StringBuilder sb = new StringBuilder(curr);
                    
                    for(char c : choices){               
                        sb.setCharAt(m, c);
                        String next = sb.toString();
                        
                        if(next.equals(end)){
                            return step + 1;
                        }
                        
                        if(set.contains(next) && !visited.contains(next)){
                            queue.offer(next);
                            visited.add(next);
                        }
                    }
                }
            }
            
            step++;
        }
        
        return -1;
    }
}

class Solution {
    int res = Integer.MAX_VALUE;
    char[] choices = new char[]{'A', 'C', 'G', 'T'};
    
    public int minMutation(String start, String end, String[] bank) {
        HashSet<String> set = new HashSet<>();
        for(String b : bank) {
            set.add(b);
        }
        
        helper(start, end, set, 0, new HashSet<>());
        
        return res == Integer.MAX_VALUE ? -1 : res;
    }
    
    private void helper(String start, String end, HashSet<String> bank, int step, HashSet<String> visited) {
        if(start.equals(end)) {
            res = Math.min(res, step);
            return;
        }
        
        for(int i = 0; i < 8; i++) {
            char s = start.charAt(i);
            char e = end.charAt(i);
            
            StringBuilder sb = new StringBuilder(start);
            
            for(char c : choices) {
                sb.setCharAt(i, c);
                String next = sb.toString();
                if(c == s) continue;
                
                if(bank.contains(next) && !visited.contains(next)) {
                    visited.add(next);
                    helper(next, end, bank, step + 1, visited);
                    visited.remove(next);
                }
            }
        }
    }
}