299. Bulls and Cows
2016-03-18 21:22
363 查看
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:
Hint:
and
(The bull is
the cows are
Write a function to return a hint according to the secret number and friend's guess, use
indicate the bulls and
return
Please note that both secret number and friend's guess may contain duplicate digits, for example:
In this case, the 1st
friend's guess is a bull, the 2nd or 3rd
a cow, and your function should return
You may assume that the secret number and your friend's guess only contain digits, and their lengths are always equal.
Credits:
Special thanks to @jeantimex for adding this problem and creating all test cases.
Subscribe to see which companies asked this question
用HashMap做,没啥说的,第一次把正确的找出来,然后把猜的里面不对的字母和数量用个Map存起来,再去正解里面找一圈就好
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:
1bull
and
3cows.
(The bull is
8,
the cows are
0,
1and
7.)
Write a function to return a hint according to the secret number and friend's guess, use
Ato
indicate the bulls and
Bto 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
1in
friend's guess is a bull, the 2nd or 3rd
1is
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.
Credits:
Special thanks to @jeantimex for adding this problem and creating all test cases.
Subscribe to see which companies asked this question
用HashMap做,没啥说的,第一次把正确的找出来,然后把猜的里面不对的字母和数量用个Map存起来,再去正解里面找一圈就好
public class Solution { public String getHint(String secret, String guess) { char [] s = secret.toCharArray(); char [] g = guess.toCharArray(); HashMap<Character,Integer> maps = new HashMap<>(); List<Character> postDealList = new LinkedList<>(); int A = 0,B = 0; for(int i =0;i<s.length;i++) {if(s[i]==g[i])A++; else{ if(!maps.containsKey(s[i]))maps.put(s[i],0); maps.replace(s[i],maps.get(s[i])+1); postDealList.add(g[i]); } } int size = postDealList.size(); for(int i = 0;i<size;i++){ char gu = postDealList.get(i); if(maps.containsKey(gu)){ int val = maps.get(gu); B++; if(val-1==0)maps.remove(gu); else{ maps.replace(gu,val-1); } } } return String.valueOf(A)+"A"+String.valueOf(B)+"B"; } }
相关文章推荐
- UIView 中position 和anchorPoint 的了解 iOS
- 58. Length of Last Word
- python数据类型--字典
- 这是第一篇文章
- C语言中访问结构体成员时用‘.’和‘->’的区别
- 用Python直接写UTF-8文本文件
- Problem D: 求最高同学位置
- python数据类型--序列
- 20. Valid Parentheses
- [置顶] Sublime优美设置(待续)
- 将URI对象转换为文件绝对路径的方法
- HDU-1176-免费馅饼
- Problem C: 统计不及格人数
- python数据类型
- 图数据库Neo4j介绍
- java实现oracle数据库基本操作
- JavaScript:Object.prototype.toString进行数据类型判定
- 205. Isomorphic Strings
- Apache Kafka编程入门指南:Producer
- 读《java夜未眠》