[299] Bulls and Cows
来源:互联网 发布:大数据时代读书报告 编辑:程序博客网 时间:2024/06/15 01:34
[题目描述]
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 andB
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.
【解题思路】哈希表,扫描两边,时间复杂度O(n)
【代码】
class Solution {public: string getHint(string secret, string guess) { int cntA=0,cntB=0; int lens=secret.length(); int leng=guess.length(); string a,b; stringstream ss,ss1; map<char,int> m; for(int i=0;i<lens;i++){ m[secret[i]]++; if(secret[i]==guess[i]){ cntA++; m[secret[i]]--; } } for(int i=0;i<lens;i++){ if(secret[i]!=guess[i]&&m[guess[i]]!=0){ cntB++; m[guess[i]]--; } } ss<<cntA; ss>>a; ss1<<cntB; ss1>>b; return a+"A"+b+"B"; }};
- [299] Bulls and Cows
- [299] Bulls and Cows
- leetcode 299:Bulls and Cows
- Bulls and Cows leetcode 299
- 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-e-Bulls and Cows
- LeetCode 299 Bulls and Cows
- leetcode 299 Bulls and Cows
- 欢迎使用CSDN-markdown编辑器
- docker学习6--容器搭建JDK/tomcat环境
- To Java程序员:切勿用普通for循环遍历LinkedList
- D-Link NAS, DNS 系列:通过非认证SMB实现存储型XSS
- java辅助开发的两个封装类
- [299] Bulls and Cows
- 数据工程师必知算法:蓄水池抽样
- 如何知道linux内核是否开启CONFIG_PACKET选项
- 虚拟机刚装了linux 系统,如何添加一块新硬盘?
- 笔记---第一章
- [React Native]高度自增长的TextInput组件
- leetcode:Trie:Implement Trie (Prefix Tree)(208)
- HDU2044一只小蜜蜂...
- 文件存储密码