题目描述:

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.

For example:

Secret number:  "1807"
Friend's guess: "7810"

Hint: 1 bull and 3 cows. (The bull is 8, the cows are 01 and 7.)

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. In the above example, your function should return "1A3B".

Please note that both secret number and friend's guess may contain duplicate digits, for example:

Secret number:  "1123"
Friend's guess: "0111"

In this case, the 1st 1 in friend's guess is a bull, the 2nd or 3rd 1 is a cow, and your function should return "1A1B".

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

解题思路:

对于secret列每次读取相应的部分,如果与guess对应的部分相同,则bulls变量加一;否则,对于secret的部分相应字典的数值加一,guess对应的字典减一。

再判断secret对应字典的数值是否小于等于0,若是则把bulls的变量加一(表明之前guess中已经出现该字符,且配对成功)

判断guess对应字典的数值是否大于等于0,若是则把bulls的变量加一(表明之前secret中已经出现该字符,且配对成功)

代码如下:

public class Solution {
public String getHint(String secret, String guess) {
int bulls = 0, cows = 0;
int[] count = new int[10];
for(int i = 0; i < secret.length(); i++){
if(secret.charAt(i) == guess.charAt(i)){
bulls++;
}
else {
count[secret.charAt(i) - '0']++;
count[guess.charAt(i) - '0']--;
if(count[secret.charAt(i) - '0'] <= 0)
cows++;
if(count[guess.charAt(i) - '0'] >= 0)
cows++;
}
}
return bulls + "A" + cows + "B";
}
}

  

最新文章

  1. Java(JCo3)与SAP系统相互调用
  2. 此数据库文件与当前sql server实例不兼容
  3. HDU3434 Sequence Adjustment
  4. oracle中修改表名
  5. python时间处理之datetime
  6. ASP.NET转换人民币大小金额
  7. HTTPS协议加密解密全过程(图解)
  8. C#类中字段,属性与方法
  9. 折返(Reentrancy)VS线程安全(Thread safety)
  10. Texture的渲染及截屏功能
  11. [Android Pro] 关于Android 7.0无法进行https抓包的问题
  12. foreman ubuntu16快速安装
  13. Yii2 Apache + Nginx 路由重写
  14. VS2012 No exports were found that match the constraint
  15. 【Javascript Demo】根据Email地址跳转到相应的邮箱登录页面
  16. 对 tensorflow 中 tf.nn.embedding_lookup 函数的解释
  17. vue相对路径修改
  18. 2009中国IT界名人
  19. Java找出一组数字的最大值
  20. 15-----jQuery补充

热门文章

  1. python学习之“切片操作从入门到精通”
  2. java递归查询方法
  3. Directx3D SimpleSample Sample
  4. linux系统进程的内存布局
  5. Socket 阻塞模式和非阻塞模式
  6. ajax post 跨域
  7. OneAPM 技术公开课第二讲:开启性能为王的架构时代
  8. POJ 1928
  9. 拼写sql语句随笔
  10. autocomplete参数说明以及实例