Leetcode: Bulls and Cows
来源:互联网 发布:pdf.js 缓存问题 编辑:程序博客网 时间:2024/06/03 11:17
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 are0
, 1
and 7
.)Write a function to return a hint according to the secret number and friend's guess, useA
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> secretNums(10, 0); vector<int> guessNums(10, 0); int bulls = 0; int cows = 0; for (int i = 0; i < secret.size(); ++i) { if (secret[i] == guess[i]) { ++bulls; } else { ++secretNums[secret[i] - '0']; ++guessNums[guess[i] - '0']; } } for (int i = 0; i < secretNums.size(); ++i) { cows += min(secretNums[i], guessNums[i]); } return (to_string(bulls) + "A" + to_string(cows) + "B"); }};
- [LeetCode]Bulls and Cows
- [LeetCode] Bulls and Cows
- LeetCode Bulls and Cows
- leetcode | Bulls and Cows
- LeetCode:Bulls and Cows
- LeetCode -- Bulls and Cows
- leetcode: Bulls and Cows
- [leetcode]Bulls and Cows
- Bulls and Cows-LeetCode
- [Leetcode]Bulls and Cows
- Leetcode: Bulls and Cows
- LeetCode Bulls and Cows
- 【Leetcode】bulls and cows
- LeetCode Bulls and Cows
- LeetCode: Bulls and Cows
- Leetcode - Bulls and Cows
- LeetCode:Bulls and Cows
- 【Leetcode】Bulls and Cows
- ICANN所做的工作就是要保证网络域名的稳定
- ios facebook 开源动画 pop 常用动画
- LinuxWindowSDK开发日记
- Traceoute
- 互联网的规模和发展速度远远超出网络设计先驱者的预想
- Leetcode: Bulls and Cows
- HttpURLConnection用法
- 用BCP命令将TSV,CSV等包含日期数据的字段导入SqlServer数据库
- Java基础--集合框架Conllection(LinkedList、ArrayList)
- Itext+POI将Excel转换为PDF
- cf #310 E. Case of Chocolate (upper_bound())
- MAC MacVim及Vundle安装
- 7 Software Testing Myths
- maven部署war文件到Tomcat