Leetcode_299_Bulls and Cows
本文是在学习中的总结,欢迎转载但请注明出处:http://blog.csdn.net/pistolove/article/details/50768550
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 0
, 1
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
思路:
(1)题意为给定两串数字,当中的一串数字能够看作为password,还有一串可看作为待推測的数字,将猜对了的数字(位置和数字都同样)个数记为:个数+A,将位置不正确而包括在password中的数字个数记为:个数+B。
(2)该题主要考察字符匹配问题。因为两串数字中数的个数同样,所以,对于位置同样且数字亦同样的情况。仅仅需遍历一次就能得到bull的个数;而对于位置不同且含有同样数的情况,则须要进行特殊处理以得到cow的个数。
一方面。可能某一个数在当中的某一串数中出现了多次。还有一方面,位置同样且数同样的情况也须要进行过滤。此处,创建一个Map来进行存储和过滤。当中。map的key为数串中的数,value为该数出现的次数。这样通过一次遍历就可以将数和其个数存储起来。然后再进行两次遍历,分别得到同一位置上数同样情况的个数和不同位置上数同样情况的个数,即为所求。
详情见下方代码。
(3)希望本文对你有所帮助。
谢谢。
算法代码实现例如以下:
import java.util.HashMap;
import java.util.Map; public class Bulls_and_Cows { public static void main(String[] args) {
System.err.println(getHint("1122", "1222"));
} public static String getHint(String secret, String guess) {
char[] se = secret.toCharArray();
char[] gu = guess.toCharArray(); int len = se.length;
int bull = 0;
int cow = 0; Map<Character, Integer> seHas = new HashMap<Character, Integer>();
for (int i = 0; i < len; i++) {
if (!seHas.containsKey(se[i])) {
seHas.put(se[i], 1);
} else {
seHas.put(se[i], seHas.get(se[i]) + 1);
}
} Boolean[] b = new Boolean[len];
for (int i = 0; i < len; i++) {
if (se[i] == gu[i]) {
b[i] = true;
seHas.put(gu[i], seHas.get(gu[i])-1);
cow++;
}else {
b[i] = false;
}
} for (int j = 0; j < len; j++) {
if(b[j] == false && seHas.get(gu[j])!=null && seHas.get(gu[j])>0) {
bull ++;
seHas.put(gu[j], seHas.get(gu[j])-1);
}
} return cow + "A" + bull + "B";
}
}
Leetcode_299_Bulls and Cows的更多相关文章
- [LeetCode] Bulls and Cows 公母牛游戏
You are playing the following Bulls and Cows game with your friend: You write a 4-digit secret numbe ...
- POJ 2186 Popular Cows(Targin缩点)
传送门 Popular Cows Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 31808 Accepted: 1292 ...
- POJ 2387 Til the Cows Come Home(最短路 Dijkstra/spfa)
传送门 Til the Cows Come Home Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 46727 Acce ...
- LeetCode 299 Bulls and Cows
Problem: You are playing the following Bulls and Cows game with your friend: You write down a number ...
- [Leetcode] Bulls and Cows
You are playing the following Bulls and Cows game with your friend: You write a 4-digit secret numbe ...
- 【BZOJ3314】 [Usaco2013 Nov]Crowded Cows 单调队列
第一次写单调队列太垃圾... 左右各扫一遍即可. #include <iostream> #include <cstdio> #include <cstring> ...
- POJ2186 Popular Cows [强连通分量|缩点]
Popular Cows Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 31241 Accepted: 12691 De ...
- Poj2186Popular Cows
Popular Cows Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 31533 Accepted: 12817 De ...
- [poj2182] Lost Cows (线段树)
线段树 Description N (2 <= N <= 8,000) cows have unique brands in the range 1..N. In a spectacula ...
随机推荐
- Uva1335 二分+贪心
/* 奇数怎么搞呢 二分到答案怎么judge呢 贪心怎么贪呢 假设贪心方案是 前两个挨着取 后面的能靠前就靠前 这样子似乎保证了ans最min 但是不管贪的对不对 操作起来时间GG 而且 如果真的这样 ...
- Linux - 进程与内存查看
top NI表示进程的优先级. -20的优先级,非常的高. top -p xxx 可以查看具体的进程情况. renice -n -6 进程ID 可以改变一个正在运行的pid的优先级. [root@lo ...
- angular2 使用swiper
欢迎加入前端交流群交流知识&&获取视频资料:749539640 第一步: npm install swiper --save 第二步:下载swiper ts支持(http://micr ...
- 2014/09/20 关于ArrayList的几种操作
1.删除ArrayList集合元素 删除ArrayList集合里面的元素时,提供了Clear方法,Remove方法,RmoveAt方法和RemoveRange方法. Clear方法是移除所有的元素 R ...
- [.Net] 导出Excel中身份证等数字串的解决方式
public static void DataTableToExcel(System.Data.DataTable dtData, String FileName) { GridView dgExpo ...
- CTF-Mayday
打开下载的Mayday.txt文件: 温柔 知足突然好想你 拥抱突然好想你 拥抱温柔 知足温柔 知足突然好想你 拥抱突然好想你 拥抱温柔 知足温柔 知足突然好想你 拥抱突然好想你 拥抱温柔 ...
- C - Queue at the School
Problem description During the break the schoolchildren, boys and girls, formed a queue of n people ...
- week1 notebook1
初识Python 一.python介绍 - 解释器: cpython(默认使用) ipython(shell) jpython(java) ironpython rubypython - 编码: as ...
- winfrom控件——基本工具
窗体事件:属性—事件—load(双击添加) 窗体加载完之后的事件: 删除事件:先将属性事件里挂号的事件名删掉(行为里的load)再删后台代码里的事件. 控件:工具箱里(搜索—双击或点击拖动到窗体界面) ...
- ComboBoxEdit 添加键值
ComboBoxEdit combo = new ComboBoxEdit(); var coll = combo.Properties.Items; coll.BeginUpdate(); try ...