LeetCode Bulls and Cows
2015-11-04 00:13
295 查看
题目:
You are playing the following Bulls and Cows game with your friend:
You write a 4-digit secret number and ask your friend to guess it. Each time your friend guesses a number, you give a hint. The hint tells your friend how many digits are in the correct positions (called "bulls") and how many digits are in the wrong positions
(called "cows"). Your friend will use those hints to find out 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
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.
题意:
LZ一开始在理解猜数字游戏时,出现了一些误解的地方,尤其是关于有猜的重复数字出现的时候。其实A是关于在正确的位置上的正确数字,而B表示的是猜的数字对,但是位置不对,如果出现重复的数字,那么只算一次。所以首先是计算在Secret数字中每个数字出现的个数,然后再用guess在减去secret数字中的已经出现的数字,得到的猜错的数字,然后用总的数字长度去减这个值,得到的就是猜对的数字,包括位置对和位置不对的。然后就是再一一的去做一次循环,得到位置对的数字的个数,然后用刚才得到的数字对但是位置不对的数字去减位置对的数字,得到就是B的格式。
public class Solution
{
public String getHint(String secret,String guess)
{
HashMap<Character,Integer> hm = new HashMap<Character,Integer>();
for(int i = 0; i < secret.length(); i++)
{
if(! hm.containsKey(secret.charAt(i)))
{
hm.put(secret.charAt(i), 1);
}
else
hm.put(secret.charAt(i), hm.get(secret.charAt(i)) + 1);
}
for(int i = 0; i < guess.length(); i++)
{
if(hm.containsKey(guess.charAt(i)) && hm.get(guess.charAt(i)) > 0)
{
hm.put(guess.charAt(i),hm.get(guess.charAt(i)) - 1);
}
} //这是看有几个猜对了,但是不管位置
int tmp = 0;
for(Integer i : hm.values())
{
tmp += i;
} //返回所有未出现的次数
int sum = secret.length() - tmp;
int numA = 0;
for(int i = 0; i < secret.length(); i++)
{
if(secret.charAt(i) == guess.charAt(i))
numA++;
}
int numB = sum - numA;
return "" + numA + "A" + numB + "B";
}
}
You are playing the following Bulls and Cows game with your friend:
You write a 4-digit secret number and ask your friend to guess it. Each time your friend guesses a number, you give a hint. The hint tells your friend how many digits are in the correct positions (called "bulls") and how many digits are in the wrong positions
(called "cows"). Your friend will use those hints to find out 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.
题意:
LZ一开始在理解猜数字游戏时,出现了一些误解的地方,尤其是关于有猜的重复数字出现的时候。其实A是关于在正确的位置上的正确数字,而B表示的是猜的数字对,但是位置不对,如果出现重复的数字,那么只算一次。所以首先是计算在Secret数字中每个数字出现的个数,然后再用guess在减去secret数字中的已经出现的数字,得到的猜错的数字,然后用总的数字长度去减这个值,得到的就是猜对的数字,包括位置对和位置不对的。然后就是再一一的去做一次循环,得到位置对的数字的个数,然后用刚才得到的数字对但是位置不对的数字去减位置对的数字,得到就是B的格式。
public class Solution
{
public String getHint(String secret,String guess)
{
HashMap<Character,Integer> hm = new HashMap<Character,Integer>();
for(int i = 0; i < secret.length(); i++)
{
if(! hm.containsKey(secret.charAt(i)))
{
hm.put(secret.charAt(i), 1);
}
else
hm.put(secret.charAt(i), hm.get(secret.charAt(i)) + 1);
}
for(int i = 0; i < guess.length(); i++)
{
if(hm.containsKey(guess.charAt(i)) && hm.get(guess.charAt(i)) > 0)
{
hm.put(guess.charAt(i),hm.get(guess.charAt(i)) - 1);
}
} //这是看有几个猜对了,但是不管位置
int tmp = 0;
for(Integer i : hm.values())
{
tmp += i;
} //返回所有未出现的次数
int sum = secret.length() - tmp;
int numA = 0;
for(int i = 0; i < secret.length(); i++)
{
if(secret.charAt(i) == guess.charAt(i))
numA++;
}
int numB = sum - numA;
return "" + numA + "A" + numB + "B";
}
}
相关文章推荐
- [转]MFC制作不规则窗体
- ListSet_有序表搜索
- 如何安全的存储用户的密码
- hadoop 之 PathFilter -- 输入文件过滤器
- 项目冲刺--第三天
- 六,游戏主界面
- Android开发之ListView添加多种布局效果演示
- Lucene之——获取索引关键字给Jquery自动填充框架使用
- listView中Item控件抢占焦点
- Python 启动 Scrapy爬虫
- 个人微信公众号VI升级心路
- 用python建立最简单的web服务器
- 用户登录
- 机器学习-多变量的线性回归模型与实现笔记
- 小作坊的安全管家之软件管理
- 图像滤镜艺术---ZPhotoEngine超级算法库
- iOS学习之iOS沙盒(sandbox)机制和文件操作(一)
- varnish学习笔记
- 《30天自制操作系统》学习笔记
- linux 下MySQL主从复制