leetcode 299 Bulls and Cows
来源:互联网 发布:平衡面板数据 编辑:程序博客网 时间:2024/04/28 17:11
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.
#include <iostream>#include <cstdio>#include <string>#include <vector>#include <map>using namespace std;string getHint(string secret, string guess) {int A=0, B=0;int len = secret.length();vector<int> vec(11, 0);for(int i = 0; i < len; i++) {if(secret[i] == guess[i]) {A++;}elsevec[secret[i]-'0']++;}for(int i = 0; i < len; i++) {if(guess[i] != secret[i]) {if(vec[guess[i]-'0'] > 0) {B++;vec[guess[i] - '0'] -= 1;}}}return to_string(A) + 'A' + to_string(B) + 'B';}int main() {string secret="1123", guess="0111";//cin >> secret >> guess;cout << getHint(secret,guess) << endl;return 0;}
- 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
- 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 2 Add two Numbers
- Android学习笔记
- 最优估计书籍推荐
- Nginx 的启动、停止、平滑重启、信号控制和平滑升级
- 内存对齐的相关规则及计算
- leetcode 299 Bulls and Cows
- JSP与JS相互传值相关问题
- hive中简单介绍分区表(partition table),含动态分区(dynamic partition)与静态分区(static partition)
- Find Minimum in Rotated Sorted Array II
- [Linux]
- ES6个人学习整理(二)——let和const
- iOS开发~CocoaPods使用详细说明
- 当输入流和输出流同时作用一个文件
- 运行于x86机器上的FreeBSD的PCI中断