[Swift]LeetCode299. 猜数字游戏 | Bulls and Cows

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

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

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

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

You are playing the following Bulls and Cows game with your friend: You write down a number and ask your friend to guess what the number is. Each time your friend makes a guess, you provide a hint that indicates how many digits in said guess match your secret number exactly in both digit and position (called "bulls") and how many digits match the secret number but locate in the wrong position (called "cows"). Your friend will use successive guesses and hints to eventually derive the secret number.

Write a function to return a hint according to the secret number and friend's guess, use A to indicate the bulls and B to indicate the cows. 

Please note that both secret number and friend's guess may contain duplicate digits.

Example 1:

1
3
8
0
1
7.

Example 2:

1 
1

Note: You may assume that the secret number and your friend's guess only contain digits, and their lengths are always equal.

---

你正在和你的朋友玩 猜数字（Bulls and Cows）游戏：你写下一个数字让你的朋友猜。每次他猜测后，你给他一个提示，告诉他有多少位数字和确切位置都猜对了（称为“Bulls”, 公牛），有多少位数字猜对了但是位置不对（称为“Cows”, 奶牛）。你的朋友将会根据提示继续猜，直到猜出秘密数字。

请写出一个根据秘密数字和朋友的猜测数返回提示的函数，用 A 表示公牛，用 B 表示奶牛。

请注意秘密数字和朋友的猜测数都可能含有重复数字。

示例 1:

1
3
8
0
1
7

示例 2:

1
1

说明: 你可以假设秘密数字和朋友的猜测数都只包含数字，并且它们的长度永远相等。

---

40ms

class Solution {
    func getHint(_ secret: String, _ guess: String) -> String {
        
        var acount = 0
        var bcount = 0
        
        var secArr = Array(secret)
        var gueArr = Array(guess)
        
        for i in 0..<secArr.count where secArr[i] == gueArr[i] {
            acount += 1
            secArr[i] = "a"
            gueArr[i] = "b"
        }
        
        secArr = secArr.filter{return $0 != "a"}
        gueArr = gueArr.filter{return $0 != "b"}
        
        for i in 0..<gueArr.count {
            let gue = gueArr[i]
            
            for j in 0..<secArr.count where secArr[j] == gue {
                bcount += 1
                secArr.remove(at: j)
                break
            }
            
        }
        
        return "\(acount)A\(bcount)B"
    }
}