299. Bulls and Cows
来源:互联网 发布:房贷利率折扣变化知乎 编辑:程序博客网 时间:2024/05/16 15:38
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 are0
, 1
and 7
.)Write a function to return a hint according to the secret number and friend's guess, useA
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.
【思路】 先判断同一位置数字是否相同, 相同则A++,不同就把secret & guess 该位置的数字 分别存入hashtable
最后遍历两个hash table //这里用了两个 长度为10 的array做,比较暴力
class Solution {public: string getHint(string secret, string guess) { int bull =0; int cow =0; vector<int> bullArray(10,0); vector<int> cowArray(10,0); for(int i=0;i<secret.size();i++){ if(secret[i]==guess[i]){ bull++; } else{ bullArray[secret[i]-'0']++; cowArray[guess[i]-'0']++; } } for(int i =0;i<10;i++){ cow+= min(bullArray[i],cowArray[i]); } return to_string(bull) +'A'+to_string(cow)+'B'; }};
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- JAVA学习笔记(1)
- Python 3.6 实现简单的爬虫
- Double类型只用8字节存储但范围为什么那么大
- 单例模式再讨论(有关序列化的单例问题)
- bzoj1146: [CTSC2008]网络管理Network
- 299. Bulls and Cows
- (转)知乎:AssetMark,到底是做什么的?
- 机器学习算法及代码实现--神经网络
- 遗传算法学习材料
- 操作系统小练习6
- 句子的逆序练习题
- caffe下数据可视化
- 22.显示锁Lock
- 2277 爱吃皮蛋的小明