[Swift]LeetCode936. 戳印序列 | Stamping The Sequence

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

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

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

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

You want to form a target string of lowercase letters.

At the beginning, your sequence is target.length '?' marks.  You also have a stamp of lowercase letters.

On each turn, you may place the stamp over the sequence, and replace every letter in the sequence with the corresponding letter from the stamp.  You can make up to 10 * target.length turns.

For example, if the initial sequence is "?????", and your stamp is "abc",  then you may make "abc??", "?abc?", "??abc" in the first turn.  (Note that the stamp must be fully contained in the boundaries of the sequence in order to stamp.)

If the sequence is possible to stamp, then return an array of the index of the left-most letter being stamped at each turn.  If the sequence is not possible to stamp, return an empty array.

For example, if the sequence is "ababc", and the stamp is "abc", then we could return the answer [0, 2], corresponding to the moves "?????" -> "abc??" -> "ababc".

Also, if the sequence is possible to stamp, it is guaranteed it is possible to stamp within 10 * target.length moves.  Any answers specifying more than this number of moves will not be accepted.

Example 1:

Input: stamp = "abc", target = "ababc"
Output: [0,2]
([1,0,2] would also be accepted as an answer, as well as some other answers.)

Example 2:

Input: stamp = "abca", target = "aabcaca"
Output: [3,0,1]

Note:

1. 1 <= stamp.length <= target.length <= 1000
2. stamp and target only contain lowercase letters.

---

你想要用小写字母组成一个目标字符串 target。 

开始的时候，序列由 target.length 个 '?' 记号组成。而你有一个小写字母印章 stamp。

在每个回合，你可以将印章放在序列上，并将序列中的每个字母替换为印章上的相应字母。你最多可以进行 10 * target.length  个回合。

举个例子，如果初始序列为 "?????"，而你的印章 stamp 是 "abc"，那么在第一回合，你可以得到 "abc??"、"?abc?"、"??abc"。（请注意，印章必须完全包含在序列的边界内才能盖下去。）

如果可以印出序列，那么返回一个数组，该数组由每个回合中被印下的最左边字母的索引组成。如果不能印出序列，就返回一个空数组。

例如，如果序列是 "ababc"，印章是 "abc"，那么我们就可以返回与操作 "?????" -> "abc??" -> "ababc" 相对应的答案 [0, 2]；

另外，如果可以印出序列，那么需要保证可以在 10 * target.length 个回合内完成。任何超过此数字的答案将不被接受。

示例 1：

输入：stamp = "abc", target = "ababc"
输出：[0,2]
（[1,0,2] 以及其他一些可能的结果也将作为答案被接受）

示例 2：

输入：stamp = "aabcaca", target = "abca"
输出：[3,0,1]

提示：

1. 1 <= stamp.length <= target.length <= 1000
2. stamp 和 target 只包含小写字母。

---

52ms

class Solution {
    func movesToStamp(_ stamp: String, _ target: String) -> [Int] {
        //转换为数组
        var t:[Character] = target.toCharArray()
        var s:[Character] = stamp.toCharArray()
        
        var route:[Int] = [Int]()
        let num:Int = t.count - s.count + 1
        var done:[Bool] = [Bool](repeating:false,count:num)
        while(true)
        {
            var up:Bool = false
            for i in 0..<num
            {
                if done[i] {continue}
                var cor = cors(s, t, i)
                if cor == 1
                {
                    route.insert(i, at: 0)
                    for j in 0..<s.count
                    {
                        t[j+i] = "."
                    }
                    up = true
                    done[i] = true
                }
                else if cor == 2
                {
                    done[i] = true
                }
            }
            if !up {break}
        }
        for i in 0..<t.count
        {
            if t[i] != "."
            {
                return []
            }
        }
        var ret:[Int] = [Int](repeating:0,count:route.count)
        var p:Int = 0
        for x in route
        {
            ret[p++] = x
        }
        return ret
    }
    
    func cors(_ s:[Character],_ t:[Character],_ f:Int) -> Int
    {
        var ex:Int = 0
        for i in 0..<s.count
        {
            if t[i+f] == "." {continue}
            ex = 1
            if s[i] != t[i+f] {return 0}
        }
        if ex == 0 {return 2}
        return 1
    }
}

extension String {
    //转换为字符数组
    func toCharArray() -> [Character]
    {
        var chars:[Character] = [Character]()
        for char in self.characters
        {
            chars.append(char)
        }
        return chars
    }
}
/*扩展Int类，实现自增++运算符*/
extension Int{
    //后缀++:先执行表达式后再自增
    static postfix func ++(num:inout Int) -> Int {
        //输入输出参数num
        let temp = num
        //num加1
        num += 1
        //返回加1前的数值
        return temp
    }
}