[leetcode] 299. Bulls and Cows 解题报告
来源:互联网 发布:tps5430dda 4端口 编辑:程序博客网 时间:2024/05/29 18:46
题目链接:https://leetcode.com/problems/bulls-and-cows/
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.
思路:用一个hash表统计不相同位字符出现频率。然后用guess的字符来匹配。比较简单。
具体看代码:
class Solution {public: string getHint(string secret, string guess) { unordered_map<char, int> hash; int cnt1 = 0, cnt2 = 0; for(int i = 0; i < secret.size(); i++) { if(secret[i] == guess[i]) cnt1++; hash[secret[i]]++; } for(int i = 0 ;i < guess.size(); i++) { if(hash.count(guess[i]) && hash[guess[i]] > 0) cnt2++, hash[guess[i]]--; } return to_string(cnt1)+'A'+ to_string(cnt2-cnt1) + 'B'; }};
- [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
- 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
- 在Redhat的Hadoop上安装Petuum笔记
- Java线程外篇:阻塞队列BlockingQueue
- 友元
- 最短路径之Bellman-Ford(可以解决负边)
- 移动端border为1px的设置方法
- [leetcode] 299. Bulls and Cows 解题报告
- 基本套接字编程(7) -- udp篇
- Codeforces Round #337 (Div. 2) D.Vika and Segments
- <a>链接的不同状态
- Java 泛型通配符?解惑
- Aho-Corasick算法
- C++中 #define的用法
- php【基础学习十一】简单的加解密
- linux专业术语札记