你正在和你的朋友玩 猜数字（Bulls and Cows）游戏：你写下一个数字让你的朋友猜。每次他猜测后，你给他一个提示，告诉他有多少位数字和确切位置都猜对了（称为“Bulls”, 公牛），有多少位数字猜对了但是位置不对（称为“Cows”, 奶牛）。你的朋友将会根据提示继续猜，直到猜出秘密数字。
请写出一个根据秘密数字和朋友的猜测数返回提示的函数，用 A 表示公牛，用 B 表示奶牛。
请注意秘密数字和朋友的猜测数都可能含有重复数字。
示例 1:
输入: secret = "1807", guess = "7810"
输出: "1A3B"
解释: 1 公牛和 3 奶牛。公牛是 8，奶牛是 0, 1 和 7。
示例 2:
输入: secret = "1123", guess = "0111"
输出: "1A1B"
解释: 朋友猜测数中的第一个 1 是公牛，第二个或第三个 1 可被视为奶牛。
说明: 你可以假设秘密数字和朋友的猜测数都只包含数字，并且它们的长度永远相等。
解答
这道题，中文leetcode觉得是中等难度，英文却是简单难度
难道是对中国人来说特别难吗😂😂
最直观的反应是遍历两次，查过的地方都给删掉。。
var getHint = function (secret, guess) {
let countA = 0, countB = 0
secret = secret.split('')
guess = guess.split('')
for (let i = 0; i < secret.length; i++) {
if (secret[i] === guess[i]) {
countA++;
secret.splice(i, 1)
guess.splice(i, 1)
i--
}
}
for (let i = 0; i < guess.length; i++) {
if (secret.indexOf(guess[i]) !== -1) {
countB++
secret.splice(secret.indexOf(guess[i]), 1)
guess.splice(i, 1)
i--
}
}
return countA + "A" + countB + "B"
};
Runtime: 88 ms, faster than 14.74% of JavaScript online submissions for Bulls and Cows.
Memory Usage: 37.6 MB, less than 50.00% of JavaScript online submissions for Bulls and Cows.
数组
var getHint = function (secret, guess) {
let bulls = 0, cows = 0, sCounts = [], gCounts = []
for (let i = 0; i < 10; i++) {
sCounts[i] = 0
gCounts[i] = 0
}
for (let i = 0; i < secret.length; i++) {
if (secret[i] === guess[i]) {
bulls++
} else {
sCounts[secret[i]]++
gCounts[guess[i]]++
}
}
for (let i = 0; i < sCounts.length; i++) {
cows += Math.min(sCounts[i], gCounts[i])
}
return bulls + "A" + cows + "B"
};
Runtime: 60 ms, faster than 86.46% of JavaScript online submissions for Bulls and Cows.
Memory Usage: 36.1 MB, less than 50.00% of JavaScript online submissions for Bulls and Cows.
func Min(x, y int) int {
if x < y {
return x
}
return y
}
func getHint(secret string, guess string) string {
var bulls, cows int
var sCounts, gCounts [10]int
for i := 0; i < len(secret); i++ {
if secret[i] == guess[i] {
bulls++
} else {
sCounts[secret[i]-48]++
gCounts[guess[i]-48]++
}
}
for i := 0; i < len(sCounts); i++ {
if sCounts[i] != 0 {
cows += Min(sCounts[i], gCounts[i])
}
}
return strconv.Itoa(bulls) + "A" + strconv.Itoa(cows) + "B"
}
Runtime: 0 ms, faster than 100.00% of Go online submissions for Bulls and Cows.
Memory Usage: 2.3 MB, less than 100.00% of Go online submissions for Bulls and Cows.