同步操作将从 doocs/leetcode 强制同步,此操作会覆盖自 Fork 仓库以来所做的任何修改,且无法恢复!!!
确定后同步将在后台操作,完成时将刷新页面,请耐心等待。
The Game of Master Mind is played as follows:
The computer has four slots, and each slot will contain a ball that is red (R). yellow (Y). green (G) or blue (B). For example, the computer might have RGGB (Slot #1 is red, Slots #2 and #3 are green, Slot #4 is blue).
You, the user, are trying to guess the solution. You might, for example, guess YRGB.
When you guess the correct color for the correct slot, you get a "hit:' If you guess a color that exists but is in the wrong slot, you get a "pseudo-hit:' Note that a slot that is a hit can never count as a pseudo-hit.
For example, if the actual solution is RGBY and you guess GGRR, you have one hit and one pseudo-hit. Write a method that, given a guess and a solution, returns the number of hits and pseudo-hits.
Given a sequence of colors solution
, and a guess
, write a method that return the number of hits and pseudo-hit answer
, where answer[0]
is the number of hits and answer[1]
is the number of pseudo-hit.
Example:
Input: solution="RGBY",guess="GGRR" Output: [1,1] Explanation: hit once, pseudo-hit once.
Note:
len(solution) = len(guess) = 4
"R"
,"G"
,"B"
,"Y"
in solution
and guess
.
/**
* @param {string} solution
* @param {string} guess
* @return {number[]}
*/
var masterMind = function (solution, guess) {
let counts1 = { R: 0, G: 0, B: 0, Y: 0 };
let counts2 = { R: 0, G: 0, B: 0, Y: 0 };
let res1 = 0;
for (let i = 0; i < solution.length; i++) {
let s1 = solution.charAt(i),
s2 = guess.charAt(i);
if (s1 == s2) {
res1++;
} else {
counts1[s1] += 1;
counts2[s2] += 1;
}
}
let res2 = ["R", "G", "B", "Y"].reduce(
(a, c) => a + Math.min(counts1[c], counts2[c]),
0
);
return [res1, res2];
};
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。