[Leetcode]299. Bulls and Cows
来源:互联网 发布:电脑桌面整理软件 编辑:程序博客网 时间:2024/05/16 15:06
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){ int countA = 0, countB = 0; int num[10]={0}; for(int i = 0;i < secret.size(); ++i) { if(secret[i] == guess[i]){ ++countA; } else ++num[guess[i]-'0']; } for(int i= 0; i < secret.size(); ++i) { if(secret[i] != guess[i] && num[secret[i]-'0'] > 0){ --num[secret[i]-'0']; ++countB; } } return to_string(countA) + "A" + to_string(countB) + "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
- 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
- 什么是局域网、广域网、城域网?
- 原生JS实现跨浏览器的事件处理程序
- HttpURLConnection
- asterisk ami originate 多个变量如何写
- xUtils简介
- [Leetcode]299. Bulls and Cows
- HBuilder代码调试
- OpenCV学习笔记(三):Canny边缘检测和滚动条制作
- 【Java】异常 java.io.IOException: Stream closed 的解决办法
- UVA - 455 Periodic Strings
- uva 1455 王国
- Handler、Looper、Message源码解析
- Hadoop的发行版本介绍
- python线程锁实践实例