在线时间:8:00-16:00
迪恩网络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 Please note that both secret number and friend's guess may contain duplicate digits. Example 1: Input: secret = "1807", guess = "7810" Output: "1A3B" Explanation: Example 2: Input: secret = "1123", guess = "0111" Output: "1A1B" Explanation: The 1st 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”, 奶牛)。你的朋友将会根据提示继续猜,直到猜出秘密数字。 请写出一个根据秘密数字和朋友的猜测数返回提示的函数,用 请注意秘密数字和朋友的猜测数都可能含有重复数字。 示例 1: 输入: secret = "1807", guess = "7810" 输出: "1A3B" 解释: 示例 2: 输入: secret = "1123", guess = "0111" 输出: "1A1B" 解释: 朋友猜测数中的第一个 说明: 你可以假设秘密数字和朋友的猜测数都只包含数字,并且它们的长度永远相等。 40ms 1 class Solution { 2 func getHint(_ secret: String, _ guess: String) -> String { 3 4 var acount = 0 5 var bcount = 0 6 7 var secArr = Array(secret) 8 var gueArr = Array(guess) 9 10 for i in 0..<secArr.count where secArr[i] == gueArr[i] { 11 acount += 1 12 secArr[i] = "a" 13 gueArr[i] = "b" 14 } 15 16 secArr = secArr.filter{return $0 != "a"} 17 gueArr = gueArr.filter{return $0 != "b"} 18 19 for i in 0..<gueArr.count { 20 let gue = gueArr[i] 21 22 for j in 0..<secArr.count where secArr[j] == gue { 23 bcount += 1 24 secArr.remove(at: j) 25 break 26 } 27 28 } 29 30 return "\(acount)A\(bcount)B" 31 } 32 }
|
请发表评论