LeetCode-Hash-299. Bulls and Cows
来源:互联网 发布:儿童学编程网 编辑:程序博客网 时间:2024/05/29 16:31
问题: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”.
分析:进行两次遍历。第一次,如果对应位置上secret和guess值相等,则bull值加1.同时记录两个数组中数字出现的次数,第二次遍历中,如果数字相同,存下出现的次数,它们的和就是bull+cows。
代码:
class Solution {public: string getHint(string secret, string guess) { int l=secret.size(); int s[10]={0}; int g[10]={0}; int A=0; int B=0; int sum=0; for(int i=0;i<l;i++){ s[secret[i]-'0']++; g[guess[i]-'0']++; if(secret[i]==guess[i]) A++; } for(int i=0;i<10;i++){ sum+=min(s[i],g[i]); } B=sum-A; char ans[20]; sprintf(ans, "%dA%dB", A, B); return ans; }};
- LeetCode-Hash-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
- 【leetcode】299. Bulls and Cows
- Android 自制短信发送器
- PHP在mysql中的数据转义问题
- Spring是如何简化java开发的
- Hashtable 和 HashMap的区别
- maven冲突,maven依赖版本
- LeetCode-Hash-299. Bulls and Cows
- 【设计模式】—-(6)适配器模式(结构型)
- 简单理解IoC与DI
- [Android Studio] 编译、同步慢的解决方法 ---待完善
- 一张Java学习路线图
- java synchronized详解
- Java中事务的处理
- Centos6.5使用yum安装mysql——快速上手必备
- 利用反射机制获取Enum属性的name或者value