# Moderate 猜测序列hit或是pseudo-hit @CareerCup

914人阅读 评论(0)

package Moderate;

import java.util.Random;

/**
* The Game of Master Mind is played as follows:

The computer has four slots containing balls that are red (R ), yellow (Y), green (G) or blue (B). For example, the computer might have RGGB (e.g., 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”. For example, the guess YRGB has 2 hits and one pseudo hit.

For each guess, you are told the number of hits and pseudo-hits. Write a method that, given a guess and a solution, returns the number of hits and pseudo hits.

Master Mind游戏规则如下：

4个槽，里面放4个球，球的颜色有4种，红(R )，黄(Y)，绿(G)，蓝(B)。比如， 给出一个排列RGGB，表示第一个槽放红色球，第二和第三个槽放绿色球，第四个槽放蓝色球。

*
*/
public class S17_5 {

public static class Result {
public int hits;
public int pseudoHits;

public Result(int h, int p) {
hits = h;
pseudoHits = p;
}

public Result() {
}

public String toString() {
return "(" + hits + ", " + pseudoHits + ")";
}
};

public static int code(char c) {
switch (c) {
case 'B':
return 0;
case 'G':
return 1;
case 'R':
return 2;
case 'Y':
return 3;
default:
return -1;
}
}

public static int MAX_COLORS = 4;

public static Result estimate(String guess, String solution) {
if (guess.length() != solution.length()) return null;
Result res = new Result();
int[] frequencies = new int[MAX_COLORS];

/* Compute hits and built frequency table */
for (int i = 0; i < guess.length(); i++) {
if (guess.charAt(i) == solution.charAt(i)) {
res.hits++;
} else {
/* Only increment the frequency table (which will be used for pseudo-hits) if
* it's not a hit. If it's a hit, the slot has already been "used." */
int code = code(solution.charAt(i));
if (code >= 0) {
frequencies[code]++;		// 把答案的分布存在frequencies数组中
}
}
}

/* Compute pseudo-hits */
for (int i = 0; i < guess.length(); i++) {
int code = code(guess.charAt(i));
if (code >= 0 && frequencies[code] > 0 && guess.charAt(i) != solution.charAt(i)) {
res.pseudoHits++;
frequencies[code]--;
}
}
return res;
}

/************************** TEST CODE **********************************/

public static char letterFromCode(int k) {
switch (k) {
case 0:
return 'B';
case 1:
return 'G';
case 2:
return 'R';
case 3:
return 'Y';
default:
return '0';
}
}

public static Result estimateBad(String g, String s) {
char[] guess = g.toCharArray();
char[] solution = s.toCharArray();
int hits = 0;
for (int i = 0; i < guess.length; i++) {
if (guess[i] == solution[i]) {
hits++;
solution[i] = '0';
guess[i] = '0';
}
}

int pseudohits = 0;

for (int i = 0; i < guess.length; i++) {
if (guess[i] != '0') {
for (int j = 0; j < solution.length; j++) {
if (solution[j] != '0') {
if (solution[j] == guess[i]) {
pseudohits++;
solution[j] = '0';
break;
}
}
}
}
}

return new Result(hits, pseudohits);
}

public static String randomString() {
int length = 4;
char[] str = new char[length];
Random generator = new Random();

for (int i = 0; i < length; i++) {
int v = generator.nextInt(4);
char c = letterFromCode(v);
str[i] = c;
}

return String.valueOf(str);
}

public static boolean test(String guess, String solution) {
Result res1 = estimate(guess, solution);
if (res1.hits == res2.hits && res1.pseudoHits == res2.pseudoHits) {
return true;
} else {
System.out.println("FAIL: (" + guess + ", " + solution + "): " + res1.toString() + " | " + res2.toString());
return false;
}
}

public static boolean testRandom() {
String guess = randomString();
String solution = randomString();
return test(guess, solution);
}

public static boolean test(int count) {
for (int i = 0; i < count; i++) {
if (!testRandom()) {
return true;
}
}
return false;
}

/********************** END TEST CODE ************************/

public static void main(String[] args) {
test(1000);
}
}


0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
博客专栏
 CareerCup专栏 文章：41篇 阅读：59304
 LeetCode专栏 文章：148篇 阅读：562645
阅读排行
个人资料
• 访问：1221546次
• 积分：16554
• 等级：
• 排名：第606名
• 原创：407篇
• 转载：64篇
• 译文：0篇
• 评论：290条