299. Bulls and Cows
2016-04-13 16:23
197 查看
题目
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.
分析
遍历字符串,比较每个位是否相等,相等则记为bulls,否则在对应向量中将该位数字的记录+1,然后遍历两个向量,计算cows值,需要注意的是,虽然例子中给的cows为1,是因为secret中只有两个1,一个匹配为bulls,另一个匹配为cows,倘若secret为"1122",guess为"2211",则cows为4,因此cows计算中为v_s和v_g中的记录最小值之和。
另:int返回为string还可以使用to_string()。
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:
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.
分析
遍历字符串,比较每个位是否相等,相等则记为bulls,否则在对应向量中将该位数字的记录+1,然后遍历两个向量,计算cows值,需要注意的是,虽然例子中给的cows为1,是因为secret中只有两个1,一个匹配为bulls,另一个匹配为cows,倘若secret为"1122",guess为"2211",则cows为4,因此cows计算中为v_s和v_g中的记录最小值之和。
class Solution { public: string getHint(string secret, string guess) { vector<int> v_s(10),v_g(10); int bulls=0,cows=0; for(int i=0;i<secret.size();i++) { if(secret[i]==guess[i]) bulls++; else { v_s[secret[i]-48]++; v_g[guess[i]-48]++; } } for(int i=0;i<v_s.size();i++) { if(v_s[i]>0&&v_g[i]>0) cows=cows+min(v_s[i],v_g[i]); } ostringstream os; os<<bulls; os<<'A'; os<<cows; os<<'B'; return os.str(); } };
另:int返回为string还可以使用to_string()。
相关文章推荐
- MD5和RSA
- Android中显示html标签解决方案
- Java transient关键字使用小记
- Unity 部分错误信息提示
- 极限学习机(ELM)算法的matlab与C++实现
- functools.cmp_to_key(func)
- lightoj 1294 - Positive Negative Sign 简单数学
- 制作OpenStack Windows Server 2012镜像
- Sybase 基础SQL查询
- 笔记(4/13)spring注解
- eval 为什么加括号
- C#索引器
- BroadcastReceiver广播接受者
- bzoj 3307: 雨天的尾巴
- 递归-汉诺塔问题
- Oracle正则表达式替换字符串
- Android Studio compile project添加一个本地项目依赖包时,提示程序包不存在
- WINCE下隐藏鼠标
- Objective-c与javascript交互[详细解读2]
- UVa 800提記錄