[leetcode]299. Bulls and Cows
来源:互联网 发布:淘宝购物微信群号大全 编辑:程序博客网 时间:2024/06/05 19:51
题目链接:https://leetcode.com/problems/bulls-and-cows/#/description
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.
class Solution{public: string getHint(string secret,string guess) { vector<int> a(10,0); vector<int> b(10,0); int countA=0,countB=0; for(int i=0;i<secret.length();i++) { if(secret[i]==guess[i]) countA+=1; else { a[secret[i]-'0']+=1; b[guess[i]-'0']+=1; } } for(int i=0;i<10;i++) { countB+=min(a[i],b[i]); } string res=to_string(countA)+"A"+to_string(countB)+"B"; return res; }};
- [leetcode] 299. Bulls and Cows
- LeetCode || 299. Bulls and Cows
- LeetCode 299. Bulls and Cows
- Leetcode 299. Bulls and Cows
- LeetCode.299.Bulls and Cows
- LeetCode--299. Bulls and Cows
- 【LeetCode】299. Bulls and Cows
- [leetcode] 299. Bulls and Cows
- LeetCode *** 299. Bulls and Cows
- leetcode 299. Bulls and Cows
- LeetCode 299. Bulls and Cows
- LeetCode-299.Bulls and Cows
- Leetcode 299. Bulls and Cows
- 299.[leetcode]Bulls and Cows
- leetcode 299. Bulls and Cows
- LeetCode 299. Bulls and Cows
- 【leetcode】299. Bulls and Cows
- LeetCode 299. Bulls and Cows
- volatile和synchronized的区别
- spring的IOC容器比New对象究竟好在哪
- iOS-保持界面流畅的技巧
- c++第五次作业
- 在mac 机器上常用的命令(留作备份)持续更新~
- [leetcode]299. Bulls and Cows
- 阴面的办公室不能租
- DokiCam 360°4K相机:为极致运动爱好者而生
- 大流量、高并发的网站的底层系统架构
- LinkedList<E> 及模拟栈结构
- DNS域名解析
- 大数据运算系统(2)--- 图计算系统
- 如何用消息系统避免分布式事务?
- Hibernate_映射_继承结构映射2_另外两种映射方式