299. Bulls and Cows
来源:互联网 发布:怎么发布软件 编辑:程序博客网 时间:2024/04/29 21:57
299. 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.
Analysis:
题目难理解,英语是硬伤。
参考:[LeetCode] Bulls and Cows 公母牛游戏
Source Code(C++):
#include <iostream>#include <string>#include <map>#include <vector>using namespace std;class Solution {public: string getHint(string secret, string guess) { if (secret.size() != guess.size()) { return "error"; } if (secret.empty()) { return "error"; } int bulls=0, cows=0; int m[10]={0}; for (int i=0; i<secret.size(); i++) { if (secret.at(i) == guess.at(i)) { bulls++; } else { if (m[secret.at(i)-'0']<0 || m[guess.at(i)-'0']>0) { cows++; } m[secret.at(i)-'0']++; m[guess.at(i)-'0']--; } } return to_string(bulls)+"A"+to_string(cows)+"B"; }};int main() { Solution sol; cout << sol.getHint("eb", "ee"); return 0;}
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- Extjs的API阅读方式(整理)
- OC 对 URL 进行 URLEncode 编码
- Git常用指令集
- C#正则表达式2
- 欧拉函数
- 299. Bulls and Cows
- codeforces 676B Pyramid of Glasses 递归
- 数据结构和算法--引言
- linux tar压缩
- java的synchronized(参数),参数是this对象和参数是非this对象的区别
- ZOJ 2229 Ride to School
- FPGA verilog做基于模板的图像处理的方法
- java中获取浏览器信息
- “未能找到任何适合于指定的区域性或非特定区域性的资源”解决方法