[Swift]LeetCode650. 只有两个键的键盘 | 2 Keys Keyboard

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

热烈欢迎，请直接点击！！！

进入博主App Store主页，下载使用各个作品！！！

注：博主将坚持每月上线一个新app！！！

Initially on a notepad only one character 'A' is present. You can perform two operations on this notepad for each step:

1. Copy All: You can copy all the characters present on the notepad (partial copy is not allowed).
2. Paste: You can paste the characters which are copied last time. 

Given a number n. You have to get exactly n 'A' on the notepad by performing the minimum number of steps permitted. Output the minimum number of steps to get n'A'.

Example 1:

Input: 3
Output: 3
Explanation:
Intitally, we have one character 'A'.
In step 1, we use Copy All operation.
In step 2, we use Paste operation to get 'AA'.
In step 3, we use Paste operation to get 'AAA'. 

Note:

1. The n will be in the range [1, 1000].

---

最初在一个记事本上只有一个字符 'A'。你每次可以对这个记事本进行两种操作：

1. Copy All (复制全部) : 你可以复制这个记事本中的所有字符(部分的复制是不允许的)。
2. Paste (粘贴) : 你可以粘贴你上一次复制的字符。

给定一个数字 n 。你需要使用最少的操作次数，在记事本中打印出恰好 n 个 'A'。输出能够打印出 n 个 'A' 的最少操作次数。

示例 1:

输入: 3
输出: 3
解释:
最初, 我们只有一个字符 'A'。
第 1 步, 我们使用 Copy All 操作。
第 2 步, 我们使用 Paste 操作来获得 'AA'。
第 3 步, 我们使用 Paste 操作来获得 'AAA'。

说明:

1. n 的取值范围是 [1, 1000] 。

---

4ms

class Solution {
    func minSteps(_ n: Int) -> Int {
        if n == 1 {
            return 0
        }
        // n = p * q * r * .....
        // res = p + q + r + ....
        var mem = [Int: Int]()
        return getMin(n, &mem)
    }
    
    func getMin(_ n: Int, _ mem: inout [Int: Int]) -> Int {
        if let res = mem[n] {
            return res
        }
        
        let mid = Int(sqrt(Double(n)))
        var res = n
        var p = 2
        while p <= mid {
            if n % p == 0 {
                res = min(res, p + getMin(n/p, &mem))
            }
            p += 1
        }
        
        return res
    }
}

---

8ms

class Solution {
    func minSteps(_ n: Int) -> Int {
        if n <= 1 {
            return 0
        }
        guard n > 3 else {
            return n
        }
        var res = 0
        var num = n
        var i = 2
        while i < num + 1 {
            while num % i == 0 {
                res += i
                num /= i
            }
            i += 1
        }
        return res
    } 
}

---

12ms

class Solution {
    func minSteps(_ n: Int) -> Int {        
        guard n > 1 else {
            return 0
        }
        var n = n        
        var result = 0        
        for i in 2 ... n {
            
            while n % i == 0 {
                result += i
                n /= i
            }
        }        
        return result
    }
}

---

24ms

class Solution {
    func minSteps(_ n: Int) -> Int {
        // n -> Cn
        // m -> n = Dm
        if n == 1{
            return 0
        }else if n < 4{
            return n
        }
        
        var MS = [Int](repeating: 0, count: n + 1)
        MS[1] = 0
        for i in 2...n{
            MS[i] = i
        }
        var midX = n / 2
        for i in 2...midX{
            var multiplier = 2
            while(i * multiplier <= n){
                MS[i * multiplier] = MS[i] + multiplier
                multiplier += 1
            }   
        }
        return MS[n]
    }
}

---

24ms

class Solution {
    func minSteps(_ n: Int) -> Int {
    if(n==1){return 0}
    func isPrime(num:Int)->Bool{
        if(num==1){return true}
        for i in 1...Int(sqrt(Double.init(num))){
            if(i>1 && Double(num)/Double(i) - Double(num/i) == 0){return false}
        }
        return true
    }
    var n = n
    var primeList = [Int]()
    while !isPrime(num: n) {
        var i = 2
        while i <= Int(sqrt(Double.init(n))){
            if(isPrime(num: i)){
                if  Double(n)/Double(i) - Double(n/i) == 0{
                    primeList.append(i)
                    n = n/i
                    i=2
                }else{
                    i+=1
                }
            }else{
                i+=1
                
            }
        }
    }
    primeList.append(n)
    return primeList.reduce(0) { (Result, mInt) -> Int in
        return Result+mInt
    }
  }
}

---

40ms

class Solution {
    func minSteps(_ n: Int) -> Int {
        if n == 1 {
            return 0
        }
        return minSteps(current: 1, n: n, copied: 1) + 1
    }    
    
    func minSteps(current: Int, n: Int, copied: Int) -> Int {
        if current == n {
            return 0
        }
        
        if current > n {
            return -1
        }
        
        let copyCurrentAndPaste = minSteps(current: current * 2, n: n, copied: current)
        let pasteAlreadyCopied = minSteps(current: current + copied, n: n, copied: copied)
        
        if copyCurrentAndPaste == -1 && pasteAlreadyCopied == -1 {
            return -1
        } else if copyCurrentAndPaste == -1 {
            return pasteAlreadyCopied + 1
        } else if pasteAlreadyCopied == -1 {
            return copyCurrentAndPaste + 2
        } else {
            if copyCurrentAndPaste < pasteAlreadyCopied {
                return copyCurrentAndPaste + 2
            } else {
                return pasteAlreadyCopied + 1
            }
        }
        
    }
}