[Swift]LeetCode664. 奇怪的打印机 | Strange Printer

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

There is a strange printer with the following two special requirements:

1. The printer can only print a sequence of the same character each time.
2. At each turn, the printer can print new characters starting from and ending at any places, and will cover the original existing characters. 

Given a string consists of lower English letters only, your job is to count the minimum number of turns the printer needed in order to print it.

Example 1:

Input: "aaabbb"
Output: 2
Explanation: Print "aaa" first and then print "bbb". 

Example 2:

Input: "aba"
Output: 2
Explanation: Print "aaa" first and then print "b" from the second place of the string, which will cover the existing character 'a'.

Hint: Length of the given string will not exceed 100.

---

有台奇怪的打印机有以下两个特殊要求：

1. 打印机每次只能打印同一个字符序列。
2. 每次可以在任意起始和结束位置打印新字符，并且会覆盖掉原来已有的字符。

给定一个只包含小写英文字母的字符串，你的任务是计算这个打印机打印它需要的最少次数。

示例 1:

输入: "aaabbb"
输出: 2
解释: 首先打印 "aaa" 然后打印 "bbb"。

示例 2:

输入: "aba"
输出: 2
解释: 首先打印 "aaa" 然后在第二个位置打印 "b" 覆盖掉原来的字符 'a'。

提示: 输入字符串的长度不会超过 100。

---

116ms

class Solution {
    func strangePrinter(_ s: String) -> Int {
        var c = [Character]()
        var pre : Character = " "
        for (_, char) in s.enumerated() {
            if char != pre {
                c.append(char)
                pre = char
            }
        }
        var l = [[Int]](repeating:[Int](repeating: 0, count:c.count) , count:c.count)
        return turn(c, 0, c.count - 1, &l)
    }
    
    func turn(_ c: [Character], _ i: Int, _ j: Int, _ l: inout [[Int]]) -> Int {
        if i > j {
            return 0
        }
        if l[i][j] > 0 {
            return l[i][j]
        }
        var ans = turn(c, i, j-1, &l) + 1
        for k in i ..< j {
            if c[k] == c[j] {
                ans = min(ans, turn(c, i, k, &l) + turn(c, k+1, j-1, &l))
            }
        }
        l[i][j] = ans
        return ans
    }
}

---

Runtime: 196 ms

Memory Usage: 19.9 MB

class Solution {
    func strangePrinter(_ s: String) -> Int {
        if s.isEmpty {return 0}
        var arr:[Character] = Array(s)
        var n:Int = s.count
        var dp:[[Int]] = [[Int]](repeating:[Int](repeating:0,count:n),count:n)
        for i in (0...(n - 1)).reversed()
        {
            if(n < i) {continue}
            for j in i..<n
            {
                dp[i][j] = (i == j) ? 1 : (1 + dp[i + 1][j])
                if(j < i + 1) {continue}
                for k in (i + 1)...j
                {
                    if arr[k] == arr[i]
                    {
                        dp[i][j] = min(dp[i][j], dp[i + 1][k - 1] + dp[k][j])
                    }
                }
            }
        }
        return (n == 0) ? 0 : dp[0][n - 1]
    }
}