[Swift]LeetCode433. 最小基因变化 | Minimum Genetic Mutation

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址：https://www.cnblogs.com/strengthen/p/10334346.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

A gene string can be represented by an 8-character long string, with choices from "A", "C", "G", "T".

Suppose we need to investigate about a mutation (mutation from "start" to "end"), where ONE mutation is defined as ONE single character changed in the gene string.

For example, "AACCGGTT" -> "AACCGGTA" is 1 mutation.

Also, there is a given gene "bank", which records all the valid gene mutations. A gene must be in the bank to make it a valid gene string.

Now, given 3 things - start, end, bank, your task is to determine what is the minimum number of mutations needed to mutate from "start" to "end". If there is no such a mutation, return -1.

Note:

1. Starting point is assumed to be valid, so it might not be included in the bank.
2. If multiple mutations are needed, all mutations during in the sequence must be valid.
3. You may assume start and end string is not the same. 

Example 1:

start: "AACCGGTT"
end:   "AACCGGTA"
bank: ["AACCGGTA"]

return: 1 

Example 2:

start: "AACCGGTT"
end:   "AAACGGTA"
bank: ["AACCGGTA", "AACCGCTA", "AAACGGTA"]

return: 2 

Example 3:

start: "AAAAACCC"
end:   "AACCCCCC"
bank: ["AAAACCCC", "AAACCCCC", "AACCCCCC"]

return: 3

---

一条基因序列由一个带有8个字符的字符串表示，其中每个字符都属于 "A", "C", "G", "T"中的任意一个。

假设我们要调查一个基因序列的变化。一次基因变化意味着这个基因序列中的一个字符发生了变化。

例如，基因序列由"AACCGGTT" 变化至 "AACCGGTA" 即发生了一次基因变化。

与此同时，每一次基因变化的结果，都需要是一个合法的基因串，即该结果属于一个基因库。

现在给定3个参数 — start, end, bank，分别代表起始基因序列，目标基因序列及基因库，请找出能够使起始基因序列变化为目标基因序列所需的最少变化次数。如果无法实现目标变化，请返回 -1。

注意:

1. 起始基因序列默认是合法的，但是它并不一定会出现在基因库中。
2. 所有的目标基因序列必须是合法的。
3. 假定起始基因序列与目标基因序列是不一样的。

示例 1:

start: "AACCGGTT"
end:   "AACCGGTA"
bank: ["AACCGGTA"]

返回值: 1

示例 2:

start: "AACCGGTT"
end:   "AAACGGTA"
bank: ["AACCGGTA", "AACCGCTA", "AAACGGTA"]

返回值: 2

示例 3:

start: "AAAAACCC"
end:   "AACCCCCC"
bank: ["AAAACCCC", "AAACCCCC", "AACCCCCC"]

返回值: 3

---

8ms

class Solution {
    func minMutation(_ start: String, _ end: String, _ bank: [String]) -> Int {
        var bank = bank
        var explored:[Bool] = [Bool](repeating:false,count:bank.count)
        if bank.isEmpty {return -1}
        return minMutation(&explored, start, end, &bank)
    }
    
    func minMutation(_ explored:inout [Bool],_ start:String,_ end:String,_ bank:inout[String]) -> Int
    {
        if start == end {return 0}
        var step:Int = bank.count + 1
        for i in 0..<bank.count
        {
            if diffOne(start, bank[i]) && !explored[i]
            {
                explored[i] = true
                var temp:Int = minMutation(&explored, bank[i], end, &bank)
                if temp != -1
                {
                    step = min(step, temp)
                }
                explored[i] = false
            }            
        }
        return step == bank.count + 1 ? -1 : 1 + step
    }
    
    func diffOne(_ s1:String,_ s2:String) -> Bool
    {
        var count:Int = 0
        for i in 0..<s1.count
        {
            if s1[i] != s2[i]
            {
                count += 1
            }
            if count >= 2
            {
                return false
            }
        }
        return count == 1
    }
}

extension String {        
    //subscript函数可以检索数组中的值
    //直接按照索引方式截取指定索引的字符
    subscript (_ i: Int) -> Character {
        //读取字符
        get {return self[index(startIndex, offsetBy: i)]}
        
    }
}

---

10ms

class Solution {
    func minMutation(_ start: String, _ end: String, _ bank: [String]) -> Int {
        let geneChoice = [Character("A"), Character("C"), Character("G"), Character("T")]
        var bankArray = Set(bank.map { Array($0) })
        var startArray = Array(start)
        var endArray = Array(end)
        var queue = [startArray]
        var mutationCount = 0
        while queue.count > 0 {
            var nextQueue = [[Character]]()
            for i in 0 ..< queue.count {
                var curr = queue[i]
                if curr == endArray {
                    return mutationCount
                }
                for j in 0 ..< 8 {
                    var c = curr[j]
                    for k in 0 ..< geneChoice.count {
                        if c != geneChoice[k] {
                            curr[j] = geneChoice[k]
                            if bankArray.contains(curr) {
                                nextQueue.append(curr)
                                bankArray.remove(curr)
                            }
                        }
                    }
                    curr[j] = c
                }
            }
            queue = nextQueue
            mutationCount += 1
        }
        return -1
    }
}

---

12ms

class Solution {
      func minMutation(_ start: String, _ end: String, _ bank: [String]) -> Int {
        if !bank.contains(end){
            return -1
        }
        if start == end{
            return 0
        }
        var max :Int = 0
        
        var arr = [String]()
        var vists = [String]()
        var temp = [String]()
        arr.append(start)
        while arr.count > 0 {
      
            for j in 0..<arr.count{
                for k in 0..<bank.count{
                    if vists.contains(bank[k]){continue}
                    var dif :Int = 0
                    for  i in 0..<8{
                        let s = arr[j].index(arr[j].startIndex, offsetBy: i)
                        let b = bank[k].index(bank[k].startIndex, offsetBy: i)
                        if arr[j][s] != bank[k][b] {
                            dif = dif + 1
                        }
                        if(i == 7  && dif == 1){
                            if bank[k] == end {return max + 1}
                            temp.append(bank[k])
                            vists.append(bank[k])
                        }
                    }
                    
                    
                }
            }
            if temp.count == 0 {return -1}else{ max = max + 1 }
            arr = temp;temp = [];
        }
        return max
    }
}